./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/locks/test_locks_10.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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:54:27,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:54:27,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:54:28,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:54:28,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:54:28,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:54:28,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:54:28,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:54:28,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:54:28,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:54:28,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:54:28,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:54:28,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:54:28,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:54:28,025 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:54:28,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:54:28,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:54:28,026 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:54:28,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:54:28,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:54:28,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:54:28,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:54:28,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:54:28,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:54:28,026 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:54:28,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:54:28,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:54:28,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:54:28,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:54:28,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:54:28,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:54:28,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:54:28,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:54:28,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:54:28,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:54:28,028 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:54:28,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:54:28,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:54:28,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:54:28,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:54:28,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:54:28,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:54:28,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:54:28,028 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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2025-03-08 00:54:28,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:54:28,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:54:28,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:54:28,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:54:28,238 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:54:28,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2025-03-08 00:54:29,349 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6a27a2b/1b2d9ddcc3784c709e0ef580e3164613/FLAG203f11f85 [2025-03-08 00:54:29,595 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:54:29,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2025-03-08 00:54:29,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6a27a2b/1b2d9ddcc3784c709e0ef580e3164613/FLAG203f11f85 [2025-03-08 00:54:29,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6a27a2b/1b2d9ddcc3784c709e0ef580e3164613 [2025-03-08 00:54:29,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:54:29,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:54:29,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:54:29,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:54:29,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:54:29,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:29" (1/1) ... [2025-03-08 00:54:29,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:29, skipping insertion in model container [2025-03-08 00:54:29,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:29" (1/1) ... [2025-03-08 00:54:29,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:54:30,038 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/locks/test_locks_10.c[3901,3914] [2025-03-08 00:54:30,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:54:30,051 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:54:30,065 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/locks/test_locks_10.c[3901,3914] [2025-03-08 00:54:30,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:54:30,077 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:54:30,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30 WrapperNode [2025-03-08 00:54:30,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:54:30,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:54:30,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:54:30,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:54:30,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,095 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 145 [2025-03-08 00:54:30,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:54:30,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:54:30,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:54:30,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:54:30,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,109 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-08 00:54:30,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,113 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:54:30,119 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:54:30,119 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:54:30,119 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:54:30,120 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (1/1) ... [2025-03-08 00:54:30,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:54:30,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:30,147 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-08 00:54:30,153 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-08 00:54:30,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:54:30,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:54:30,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:54:30,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:54:30,215 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:54:30,218 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:54:30,377 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 00:54:30,377 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:54:30,383 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:54:30,383 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:54:30,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:30 BoogieIcfgContainer [2025-03-08 00:54:30,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:54:30,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:54:30,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:54:30,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:54:30,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:54:29" (1/3) ... [2025-03-08 00:54:30,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7bb646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:30, skipping insertion in model container [2025-03-08 00:54:30,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:30" (2/3) ... [2025-03-08 00:54:30,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7bb646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:30, skipping insertion in model container [2025-03-08 00:54:30,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:30" (3/3) ... [2025-03-08 00:54:30,389 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2025-03-08 00:54:30,400 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:54:30,402 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_10.c that has 1 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:54:30,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:54:30,450 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;@7f852bcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:54:30,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:54:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.868421052631579) internal successors, (71), 39 states have internal predecessors, (71), 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-08 00:54:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:54:30,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:30,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:30,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:30,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash 111351025, now seen corresponding path program 1 times [2025-03-08 00:54:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:30,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099282280] [2025-03-08 00:54:30,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:30,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:54:30,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:54:30,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:30,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:30,621 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-08 00:54:30,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:30,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099282280] [2025-03-08 00:54:30,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099282280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:30,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:30,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:30,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630485268] [2025-03-08 00:54:30,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:30,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:30,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:30,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:30,640 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.868421052631579) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 00:54:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:30,678 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2025-03-08 00:54:30,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:30,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-03-08 00:54:30,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:30,685 INFO L225 Difference]: With dead ends: 81 [2025-03-08 00:54:30,685 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 00:54:30,687 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-08 00:54:30,690 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:30,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 00:54:30,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2025-03-08 00:54:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 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-08 00:54:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 86 transitions. [2025-03-08 00:54:30,717 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 86 transitions. Word has length 17 [2025-03-08 00:54:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:30,717 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 86 transitions. [2025-03-08 00:54:30,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 00:54:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2025-03-08 00:54:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:54:30,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:30,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:30,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:54:30,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:30,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash -182051982, now seen corresponding path program 1 times [2025-03-08 00:54:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:30,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438892712] [2025-03-08 00:54:30,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:30,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:54:30,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:54:30,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:30,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:30,784 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-08 00:54:30,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:30,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438892712] [2025-03-08 00:54:30,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438892712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:30,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:30,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:30,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928226217] [2025-03-08 00:54:30,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:30,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:30,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:30,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:30,788 INFO L87 Difference]: Start difference. First operand 47 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 00:54:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:30,806 INFO L93 Difference]: Finished difference Result 114 states and 209 transitions. [2025-03-08 00:54:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-03-08 00:54:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:30,807 INFO L225 Difference]: With dead ends: 114 [2025-03-08 00:54:30,807 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 00:54:30,807 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-08 00:54:30,808 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:30,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 143 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:30,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 00:54:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-08 00:54:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 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-08 00:54:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2025-03-08 00:54:30,815 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 17 [2025-03-08 00:54:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:30,815 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2025-03-08 00:54:30,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 00:54:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2025-03-08 00:54:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:54:30,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:30,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:30,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:54:30,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -843057680, now seen corresponding path program 1 times [2025-03-08 00:54:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744069208] [2025-03-08 00:54:30,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:30,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 00:54:30,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:54:30,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:30,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:30,862 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-08 00:54:30,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:30,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744069208] [2025-03-08 00:54:30,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744069208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:30,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:30,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:30,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466295372] [2025-03-08 00:54:30,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:30,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:30,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:30,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:30,863 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 00:54:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:30,876 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2025-03-08 00:54:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:30,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-03-08 00:54:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:30,877 INFO L225 Difference]: With dead ends: 105 [2025-03-08 00:54:30,877 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 00:54:30,877 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-08 00:54:30,878 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:30,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 00:54:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-03-08 00:54:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 69 states have internal predecessors, (124), 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-08 00:54:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 124 transitions. [2025-03-08 00:54:30,882 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 124 transitions. Word has length 18 [2025-03-08 00:54:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:30,884 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 124 transitions. [2025-03-08 00:54:30,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 00:54:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 124 transitions. [2025-03-08 00:54:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:54:30,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:30,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:30,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:54:30,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:30,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1348616305, now seen corresponding path program 1 times [2025-03-08 00:54:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:30,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24360050] [2025-03-08 00:54:30,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:30,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:30,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 00:54:30,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:54:30,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:30,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:30,918 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-08 00:54:30,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:30,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24360050] [2025-03-08 00:54:30,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24360050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:30,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:30,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366102759] [2025-03-08 00:54:30,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:30,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:30,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:30,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:30,919 INFO L87 Difference]: Start difference. First operand 70 states and 124 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 00:54:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:30,938 INFO L93 Difference]: Finished difference Result 133 states and 237 transitions. [2025-03-08 00:54:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-03-08 00:54:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:30,940 INFO L225 Difference]: With dead ends: 133 [2025-03-08 00:54:30,940 INFO L226 Difference]: Without dead ends: 131 [2025-03-08 00:54:30,940 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-08 00:54:30,940 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:30,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 125 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-08 00:54:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2025-03-08 00:54:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 92 states have internal predecessors, (165), 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-08 00:54:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 165 transitions. [2025-03-08 00:54:30,953 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 165 transitions. Word has length 18 [2025-03-08 00:54:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:30,953 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 165 transitions. [2025-03-08 00:54:30,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 00:54:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 165 transitions. [2025-03-08 00:54:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:54:30,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:30,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:30,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:54:30,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:30,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1642019312, now seen corresponding path program 1 times [2025-03-08 00:54:30,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:30,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528559076] [2025-03-08 00:54:30,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:30,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:30,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 00:54:30,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:54:30,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:30,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,008 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-08 00:54:31,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528559076] [2025-03-08 00:54:31,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528559076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065286688] [2025-03-08 00:54:31,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,012 INFO L87 Difference]: Start difference. First operand 93 states and 165 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 00:54:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,030 INFO L93 Difference]: Finished difference Result 221 states and 395 transitions. [2025-03-08 00:54:31,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-03-08 00:54:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,031 INFO L225 Difference]: With dead ends: 221 [2025-03-08 00:54:31,031 INFO L226 Difference]: Without dead ends: 133 [2025-03-08 00:54:31,031 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-08 00:54:31,032 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-08 00:54:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2025-03-08 00:54:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 130 states have internal predecessors, (231), 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-08 00:54:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 231 transitions. [2025-03-08 00:54:31,045 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 231 transitions. Word has length 18 [2025-03-08 00:54:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,047 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 231 transitions. [2025-03-08 00:54:31,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 00:54:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 231 transitions. [2025-03-08 00:54:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:54:31,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:31,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:54:31,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1142595129, now seen corresponding path program 1 times [2025-03-08 00:54:31,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87074706] [2025-03-08 00:54:31,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 00:54:31,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:54:31,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,089 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-08 00:54:31,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87074706] [2025-03-08 00:54:31,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87074706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170539157] [2025-03-08 00:54:31,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,090 INFO L87 Difference]: Start difference. First operand 131 states and 231 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08 00:54:31,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,102 INFO L93 Difference]: Finished difference Result 198 states and 346 transitions. [2025-03-08 00:54:31,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2025-03-08 00:54:31,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,104 INFO L225 Difference]: With dead ends: 198 [2025-03-08 00:54:31,105 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 00:54:31,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,106 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 00:54:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2025-03-08 00:54:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 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-08 00:54:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 231 transitions. [2025-03-08 00:54:31,113 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 231 transitions. Word has length 19 [2025-03-08 00:54:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,113 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 231 transitions. [2025-03-08 00:54:31,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08 00:54:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 231 transitions. [2025-03-08 00:54:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:54:31,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:31,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:54:31,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,117 INFO L85 PathProgramCache]: Analyzing trace with hash 637036504, now seen corresponding path program 1 times [2025-03-08 00:54:31,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978218947] [2025-03-08 00:54:31,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 00:54:31,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:54:31,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,139 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-08 00:54:31,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978218947] [2025-03-08 00:54:31,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978218947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40154252] [2025-03-08 00:54:31,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,140 INFO L87 Difference]: Start difference. First operand 133 states and 231 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08 00:54:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,151 INFO L93 Difference]: Finished difference Result 249 states and 437 transitions. [2025-03-08 00:54:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2025-03-08 00:54:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,153 INFO L225 Difference]: With dead ends: 249 [2025-03-08 00:54:31,153 INFO L226 Difference]: Without dead ends: 247 [2025-03-08 00:54:31,153 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-08 00:54:31,154 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 42 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-08 00:54:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 181. [2025-03-08 00:54:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.7277777777777779) internal successors, (311), 180 states have internal predecessors, (311), 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-08 00:54:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 311 transitions. [2025-03-08 00:54:31,165 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 311 transitions. Word has length 19 [2025-03-08 00:54:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,165 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 311 transitions. [2025-03-08 00:54:31,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08 00:54:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 311 transitions. [2025-03-08 00:54:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:54:31,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:31,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:54:31,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,166 INFO L85 PathProgramCache]: Analyzing trace with hash 343633497, now seen corresponding path program 1 times [2025-03-08 00:54:31,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143815253] [2025-03-08 00:54:31,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 00:54:31,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:54:31,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,199 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-08 00:54:31,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143815253] [2025-03-08 00:54:31,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143815253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961399041] [2025-03-08 00:54:31,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,201 INFO L87 Difference]: Start difference. First operand 181 states and 311 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08 00:54:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,215 INFO L93 Difference]: Finished difference Result 429 states and 741 transitions. [2025-03-08 00:54:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2025-03-08 00:54:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,216 INFO L225 Difference]: With dead ends: 429 [2025-03-08 00:54:31,217 INFO L226 Difference]: Without dead ends: 255 [2025-03-08 00:54:31,217 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-08 00:54:31,219 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 145 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-08 00:54:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2025-03-08 00:54:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.7103174603174602) internal successors, (431), 252 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-08 00:54:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 431 transitions. [2025-03-08 00:54:31,234 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 431 transitions. Word has length 19 [2025-03-08 00:54:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,235 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 431 transitions. [2025-03-08 00:54:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08 00:54:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 431 transitions. [2025-03-08 00:54:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:54:31,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,238 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] [2025-03-08 00:54:31,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:54:31,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1726677449, now seen corresponding path program 1 times [2025-03-08 00:54:31,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113776182] [2025-03-08 00:54:31,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 00:54:31,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:54:31,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,276 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-08 00:54:31,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113776182] [2025-03-08 00:54:31,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113776182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214123188] [2025-03-08 00:54:31,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,278 INFO L87 Difference]: Start difference. First operand 253 states and 431 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08 00:54:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,289 INFO L93 Difference]: Finished difference Result 381 states and 645 transitions. [2025-03-08 00:54:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-03-08 00:54:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,291 INFO L225 Difference]: With dead ends: 381 [2025-03-08 00:54:31,291 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 00:54:31,291 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-08 00:54:31,292 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 48 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 00:54:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2025-03-08 00:54:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 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-08 00:54:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2025-03-08 00:54:31,303 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 20 [2025-03-08 00:54:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,303 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2025-03-08 00:54:31,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08 00:54:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2025-03-08 00:54:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:54:31,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:31,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:54:31,305 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2062731222, now seen corresponding path program 1 times [2025-03-08 00:54:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079968037] [2025-03-08 00:54:31,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 00:54:31,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:54:31,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,330 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-08 00:54:31,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079968037] [2025-03-08 00:54:31,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079968037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210807918] [2025-03-08 00:54:31,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,331 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08 00:54:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,349 INFO L93 Difference]: Finished difference Result 473 states and 805 transitions. [2025-03-08 00:54:31,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-03-08 00:54:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,352 INFO L225 Difference]: With dead ends: 473 [2025-03-08 00:54:31,352 INFO L226 Difference]: Without dead ends: 471 [2025-03-08 00:54:31,353 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-08 00:54:31,353 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-08 00:54:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 357. [2025-03-08 00:54:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.648876404494382) internal successors, (587), 356 states have internal predecessors, (587), 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-08 00:54:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 587 transitions. [2025-03-08 00:54:31,368 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 587 transitions. Word has length 20 [2025-03-08 00:54:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,368 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 587 transitions. [2025-03-08 00:54:31,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08 00:54:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 587 transitions. [2025-03-08 00:54:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:54:31,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,369 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] [2025-03-08 00:54:31,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:54:31,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1769328215, now seen corresponding path program 1 times [2025-03-08 00:54:31,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284527676] [2025-03-08 00:54:31,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 00:54:31,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:54:31,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,396 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-08 00:54:31,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284527676] [2025-03-08 00:54:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284527676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629825738] [2025-03-08 00:54:31,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,397 INFO L87 Difference]: Start difference. First operand 357 states and 587 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08 00:54:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,419 INFO L93 Difference]: Finished difference Result 841 states and 1389 transitions. [2025-03-08 00:54:31,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-03-08 00:54:31,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,421 INFO L225 Difference]: With dead ends: 841 [2025-03-08 00:54:31,421 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 00:54:31,422 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-08 00:54:31,424 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 00:54:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2025-03-08 00:54:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.6321138211382114) internal successors, (803), 492 states have internal predecessors, (803), 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-08 00:54:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 803 transitions. [2025-03-08 00:54:31,437 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 803 transitions. Word has length 20 [2025-03-08 00:54:31,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,438 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 803 transitions. [2025-03-08 00:54:31,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08 00:54:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 803 transitions. [2025-03-08 00:54:31,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:54:31,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,448 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] [2025-03-08 00:54:31,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 00:54:31,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash -479814368, now seen corresponding path program 1 times [2025-03-08 00:54:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909538035] [2025-03-08 00:54:31,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:54:31,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:54:31,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,470 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-08 00:54:31,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909538035] [2025-03-08 00:54:31,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909538035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986563957] [2025-03-08 00:54:31,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,472 INFO L87 Difference]: Start difference. First operand 493 states and 803 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-08 00:54:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,488 INFO L93 Difference]: Finished difference Result 741 states and 1201 transitions. [2025-03-08 00:54:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-03-08 00:54:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,491 INFO L225 Difference]: With dead ends: 741 [2025-03-08 00:54:31,491 INFO L226 Difference]: Without dead ends: 503 [2025-03-08 00:54:31,491 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-08 00:54:31,491 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-08 00:54:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2025-03-08 00:54:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.606) internal successors, (803), 500 states have internal predecessors, (803), 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-08 00:54:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 803 transitions. [2025-03-08 00:54:31,503 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 803 transitions. Word has length 21 [2025-03-08 00:54:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,503 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 803 transitions. [2025-03-08 00:54:31,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-08 00:54:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 803 transitions. [2025-03-08 00:54:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:54:31,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,505 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] [2025-03-08 00:54:31,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 00:54:31,505 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash -985372993, now seen corresponding path program 1 times [2025-03-08 00:54:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145259747] [2025-03-08 00:54:31,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:54:31,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:54:31,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,525 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-08 00:54:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145259747] [2025-03-08 00:54:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145259747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249788740] [2025-03-08 00:54:31,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,526 INFO L87 Difference]: Start difference. First operand 501 states and 803 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-08 00:54:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,546 INFO L93 Difference]: Finished difference Result 905 states and 1477 transitions. [2025-03-08 00:54:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-03-08 00:54:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,549 INFO L225 Difference]: With dead ends: 905 [2025-03-08 00:54:31,549 INFO L226 Difference]: Without dead ends: 903 [2025-03-08 00:54:31,549 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-08 00:54:31,550 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 119 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-03-08 00:54:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 709. [2025-03-08 00:54:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.5635593220338984) internal successors, (1107), 708 states have internal predecessors, (1107), 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-08 00:54:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1107 transitions. [2025-03-08 00:54:31,567 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1107 transitions. Word has length 21 [2025-03-08 00:54:31,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,567 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1107 transitions. [2025-03-08 00:54:31,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-08 00:54:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1107 transitions. [2025-03-08 00:54:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:54:31,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,569 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] [2025-03-08 00:54:31,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 00:54:31,569 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1278776000, now seen corresponding path program 1 times [2025-03-08 00:54:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445658616] [2025-03-08 00:54:31,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:54:31,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:54:31,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,584 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-08 00:54:31,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445658616] [2025-03-08 00:54:31,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445658616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988193504] [2025-03-08 00:54:31,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,586 INFO L87 Difference]: Start difference. First operand 709 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-08 00:54:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,610 INFO L93 Difference]: Finished difference Result 1657 states and 2597 transitions. [2025-03-08 00:54:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-03-08 00:54:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,613 INFO L225 Difference]: With dead ends: 1657 [2025-03-08 00:54:31,613 INFO L226 Difference]: Without dead ends: 967 [2025-03-08 00:54:31,614 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-08 00:54:31,614 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 147 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2025-03-08 00:54:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2025-03-08 00:54:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.5466804979253113) internal successors, (1491), 964 states have internal predecessors, (1491), 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-08 00:54:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1491 transitions. [2025-03-08 00:54:31,639 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1491 transitions. Word has length 21 [2025-03-08 00:54:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,639 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1491 transitions. [2025-03-08 00:54:31,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-08 00:54:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1491 transitions. [2025-03-08 00:54:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:54:31,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,640 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] [2025-03-08 00:54:31,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 00:54:31,641 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash -481764738, now seen corresponding path program 1 times [2025-03-08 00:54:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054419301] [2025-03-08 00:54:31,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 00:54:31,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:54:31,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,657 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-08 00:54:31,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054419301] [2025-03-08 00:54:31,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054419301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772718651] [2025-03-08 00:54:31,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,658 INFO L87 Difference]: Start difference. First operand 965 states and 1491 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08 00:54:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,690 INFO L93 Difference]: Finished difference Result 1449 states and 2229 transitions. [2025-03-08 00:54:31,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-03-08 00:54:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,693 INFO L225 Difference]: With dead ends: 1449 [2025-03-08 00:54:31,693 INFO L226 Difference]: Without dead ends: 983 [2025-03-08 00:54:31,694 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-08 00:54:31,694 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 46 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-03-08 00:54:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 981. [2025-03-08 00:54:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.5214285714285714) internal successors, (1491), 980 states have internal predecessors, (1491), 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-08 00:54:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1491 transitions. [2025-03-08 00:54:31,715 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1491 transitions. Word has length 22 [2025-03-08 00:54:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,715 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1491 transitions. [2025-03-08 00:54:31,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08 00:54:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1491 transitions. [2025-03-08 00:54:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:54:31,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,716 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] [2025-03-08 00:54:31,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 00:54:31,716 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,716 INFO L85 PathProgramCache]: Analyzing trace with hash -987323363, now seen corresponding path program 1 times [2025-03-08 00:54:31,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423541468] [2025-03-08 00:54:31,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 00:54:31,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:54:31,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,735 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-08 00:54:31,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423541468] [2025-03-08 00:54:31,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423541468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441181034] [2025-03-08 00:54:31,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,737 INFO L87 Difference]: Start difference. First operand 981 states and 1491 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08 00:54:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,763 INFO L93 Difference]: Finished difference Result 1737 states and 2693 transitions. [2025-03-08 00:54:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-03-08 00:54:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,768 INFO L225 Difference]: With dead ends: 1737 [2025-03-08 00:54:31,768 INFO L226 Difference]: Without dead ends: 1735 [2025-03-08 00:54:31,768 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-08 00:54:31,769 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 33 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 117 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2025-03-08 00:54:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1413. [2025-03-08 00:54:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.475212464589235) internal successors, (2083), 1412 states have internal predecessors, (2083), 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-08 00:54:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2083 transitions. [2025-03-08 00:54:31,797 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2083 transitions. Word has length 22 [2025-03-08 00:54:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,797 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2083 transitions. [2025-03-08 00:54:31,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08 00:54:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2083 transitions. [2025-03-08 00:54:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:54:31,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,798 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] [2025-03-08 00:54:31,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 00:54:31,798 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1280726370, now seen corresponding path program 1 times [2025-03-08 00:54:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963547554] [2025-03-08 00:54:31,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 00:54:31,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:54:31,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,812 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-08 00:54:31,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963547554] [2025-03-08 00:54:31,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963547554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267086235] [2025-03-08 00:54:31,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,813 INFO L87 Difference]: Start difference. First operand 1413 states and 2083 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08 00:54:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,846 INFO L93 Difference]: Finished difference Result 3273 states and 4837 transitions. [2025-03-08 00:54:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-03-08 00:54:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,861 INFO L225 Difference]: With dead ends: 3273 [2025-03-08 00:54:31,861 INFO L226 Difference]: Without dead ends: 1895 [2025-03-08 00:54:31,862 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-08 00:54:31,863 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 43 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-03-08 00:54:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1893. [2025-03-08 00:54:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.4561310782241015) internal successors, (2755), 1892 states have internal predecessors, (2755), 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-08 00:54:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2755 transitions. [2025-03-08 00:54:31,904 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2755 transitions. Word has length 22 [2025-03-08 00:54:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:31,904 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 2755 transitions. [2025-03-08 00:54:31,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08 00:54:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2755 transitions. [2025-03-08 00:54:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:54:31,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:31,906 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] [2025-03-08 00:54:31,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 00:54:31,906 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash -542226425, now seen corresponding path program 1 times [2025-03-08 00:54:31,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:31,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944710933] [2025-03-08 00:54:31,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:31,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:54:31,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:54:31,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,928 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-08 00:54:31,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:31,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944710933] [2025-03-08 00:54:31,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944710933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:31,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:31,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:31,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759045842] [2025-03-08 00:54:31,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:31,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:31,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:31,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:31,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:31,929 INFO L87 Difference]: Start difference. First operand 1893 states and 2755 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-08 00:54:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:31,963 INFO L93 Difference]: Finished difference Result 2841 states and 4117 transitions. [2025-03-08 00:54:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:31,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-03-08 00:54:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:31,968 INFO L225 Difference]: With dead ends: 2841 [2025-03-08 00:54:31,968 INFO L226 Difference]: Without dead ends: 1927 [2025-03-08 00:54:31,969 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-08 00:54:31,969 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:31,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2025-03-08 00:54:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1925. [2025-03-08 00:54:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.431912681912682) internal successors, (2755), 1924 states have internal predecessors, (2755), 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-08 00:54:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2755 transitions. [2025-03-08 00:54:32,036 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2755 transitions. Word has length 23 [2025-03-08 00:54:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:32,036 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2755 transitions. [2025-03-08 00:54:32,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-08 00:54:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2755 transitions. [2025-03-08 00:54:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:54:32,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:32,038 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] [2025-03-08 00:54:32,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 00:54:32,038 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:32,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1047785050, now seen corresponding path program 1 times [2025-03-08 00:54:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:32,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074942056] [2025-03-08 00:54:32,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:32,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:32,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:54:32,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:54:32,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:32,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:32,055 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-08 00:54:32,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:32,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074942056] [2025-03-08 00:54:32,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074942056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:32,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:32,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143240730] [2025-03-08 00:54:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:32,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:32,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:32,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:32,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:32,056 INFO L87 Difference]: Start difference. First operand 1925 states and 2755 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-08 00:54:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:32,112 INFO L93 Difference]: Finished difference Result 3337 states and 4869 transitions. [2025-03-08 00:54:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:32,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-03-08 00:54:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:32,121 INFO L225 Difference]: With dead ends: 3337 [2025-03-08 00:54:32,121 INFO L226 Difference]: Without dead ends: 3335 [2025-03-08 00:54:32,121 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-08 00:54:32,122 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:32,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2025-03-08 00:54:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2821. [2025-03-08 00:54:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2820 states have (on average 1.3854609929078014) internal successors, (3907), 2820 states have internal predecessors, (3907), 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-08 00:54:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3907 transitions. [2025-03-08 00:54:32,191 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3907 transitions. Word has length 23 [2025-03-08 00:54:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:32,191 INFO L471 AbstractCegarLoop]: Abstraction has 2821 states and 3907 transitions. [2025-03-08 00:54:32,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-08 00:54:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3907 transitions. [2025-03-08 00:54:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:54:32,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:32,194 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] [2025-03-08 00:54:32,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 00:54:32,194 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:32,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:32,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1341188057, now seen corresponding path program 1 times [2025-03-08 00:54:32,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:32,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628713370] [2025-03-08 00:54:32,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:32,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:32,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:54:32,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:54:32,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:32,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:32,211 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-08 00:54:32,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:32,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628713370] [2025-03-08 00:54:32,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628713370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:32,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:32,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933659049] [2025-03-08 00:54:32,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:32,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:32,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:32,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:32,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:32,214 INFO L87 Difference]: Start difference. First operand 2821 states and 3907 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-08 00:54:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:32,289 INFO L93 Difference]: Finished difference Result 6473 states and 8965 transitions. [2025-03-08 00:54:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:32,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-03-08 00:54:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:32,299 INFO L225 Difference]: With dead ends: 6473 [2025-03-08 00:54:32,299 INFO L226 Difference]: Without dead ends: 3719 [2025-03-08 00:54:32,302 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-08 00:54:32,302 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 42 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:32,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-03-08 00:54:32,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3717. [2025-03-08 00:54:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 3716 states have (on average 1.3614101184068892) internal successors, (5059), 3716 states have internal predecessors, (5059), 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-08 00:54:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 5059 transitions. [2025-03-08 00:54:32,420 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 5059 transitions. Word has length 23 [2025-03-08 00:54:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:32,420 INFO L471 AbstractCegarLoop]: Abstraction has 3717 states and 5059 transitions. [2025-03-08 00:54:32,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-08 00:54:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 5059 transitions. [2025-03-08 00:54:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:54:32,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:32,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:32,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 00:54:32,423 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:32,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1878428357, now seen corresponding path program 1 times [2025-03-08 00:54:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:32,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010639839] [2025-03-08 00:54:32,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:32,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:54:32,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:54:32,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:32,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:32,436 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-08 00:54:32,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:32,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010639839] [2025-03-08 00:54:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010639839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:32,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:32,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230984181] [2025-03-08 00:54:32,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:32,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:32,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:32,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:32,437 INFO L87 Difference]: Start difference. First operand 3717 states and 5059 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:32,484 INFO L93 Difference]: Finished difference Result 5577 states and 7557 transitions. [2025-03-08 00:54:32,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:32,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 00:54:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:32,492 INFO L225 Difference]: With dead ends: 5577 [2025-03-08 00:54:32,493 INFO L226 Difference]: Without dead ends: 3783 [2025-03-08 00:54:32,495 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-08 00:54:32,495 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:32,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2025-03-08 00:54:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3781. [2025-03-08 00:54:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3781 states, 3780 states have (on average 1.3383597883597884) internal successors, (5059), 3780 states have internal predecessors, (5059), 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-08 00:54:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5059 transitions. [2025-03-08 00:54:32,568 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5059 transitions. Word has length 24 [2025-03-08 00:54:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:32,568 INFO L471 AbstractCegarLoop]: Abstraction has 3781 states and 5059 transitions. [2025-03-08 00:54:32,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5059 transitions. [2025-03-08 00:54:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:54:32,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:32,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:32,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 00:54:32,571 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:32,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1372869732, now seen corresponding path program 1 times [2025-03-08 00:54:32,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:32,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915212279] [2025-03-08 00:54:32,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:32,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:54:32,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:54:32,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:32,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:32,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-08 00:54:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915212279] [2025-03-08 00:54:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915212279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:32,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:32,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:32,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840484913] [2025-03-08 00:54:32,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:32,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:32,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:32,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:32,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:32,588 INFO L87 Difference]: Start difference. First operand 3781 states and 5059 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:32,672 INFO L93 Difference]: Finished difference Result 6409 states and 8709 transitions. [2025-03-08 00:54:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:32,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 00:54:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:32,691 INFO L225 Difference]: With dead ends: 6409 [2025-03-08 00:54:32,691 INFO L226 Difference]: Without dead ends: 6407 [2025-03-08 00:54:32,692 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-08 00:54:32,693 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 27 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:32,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:32,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2025-03-08 00:54:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 5637. [2025-03-08 00:54:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.2950674237047552) internal successors, (7299), 5636 states have internal predecessors, (7299), 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-08 00:54:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 7299 transitions. [2025-03-08 00:54:32,810 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 7299 transitions. Word has length 24 [2025-03-08 00:54:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:32,810 INFO L471 AbstractCegarLoop]: Abstraction has 5637 states and 7299 transitions. [2025-03-08 00:54:32,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 7299 transitions. [2025-03-08 00:54:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:54:32,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:32,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:32,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 00:54:32,816 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:32,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1079466725, now seen corresponding path program 1 times [2025-03-08 00:54:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550704074] [2025-03-08 00:54:32,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:32,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:54:32,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:54:32,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:32,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:32,832 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-08 00:54:32,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:32,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550704074] [2025-03-08 00:54:32,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550704074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:32,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:32,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:32,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939550089] [2025-03-08 00:54:32,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:32,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:32,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:32,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:32,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:32,834 INFO L87 Difference]: Start difference. First operand 5637 states and 7299 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:32,931 INFO L93 Difference]: Finished difference Result 12809 states and 16517 transitions. [2025-03-08 00:54:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 00:54:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:32,940 INFO L225 Difference]: With dead ends: 12809 [2025-03-08 00:54:32,940 INFO L226 Difference]: Without dead ends: 7303 [2025-03-08 00:54:32,944 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-08 00:54:32,945 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:32,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2025-03-08 00:54:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 7301. [2025-03-08 00:54:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7301 states, 7300 states have (on average 1.2628767123287672) internal successors, (9219), 7300 states have internal predecessors, (9219), 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-08 00:54:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7301 states to 7301 states and 9219 transitions. [2025-03-08 00:54:33,063 INFO L78 Accepts]: Start accepts. Automaton has 7301 states and 9219 transitions. Word has length 24 [2025-03-08 00:54:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:33,064 INFO L471 AbstractCegarLoop]: Abstraction has 7301 states and 9219 transitions. [2025-03-08 00:54:33,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 7301 states and 9219 transitions. [2025-03-08 00:54:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:54:33,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:33,068 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] [2025-03-08 00:54:33,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 00:54:33,068 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:33,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:33,069 INFO L85 PathProgramCache]: Analyzing trace with hash -390684946, now seen corresponding path program 1 times [2025-03-08 00:54:33,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:33,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115878055] [2025-03-08 00:54:33,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:33,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:33,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:54:33,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:54:33,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:33,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:33,081 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-08 00:54:33,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:33,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115878055] [2025-03-08 00:54:33,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115878055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:33,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:33,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:33,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126560543] [2025-03-08 00:54:33,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:33,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:33,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:33,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:33,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:33,082 INFO L87 Difference]: Start difference. First operand 7301 states and 9219 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-08 00:54:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:33,187 INFO L93 Difference]: Finished difference Result 10953 states and 13765 transitions. [2025-03-08 00:54:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:33,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2025-03-08 00:54:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:33,197 INFO L225 Difference]: With dead ends: 10953 [2025-03-08 00:54:33,198 INFO L226 Difference]: Without dead ends: 7431 [2025-03-08 00:54:33,201 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-08 00:54:33,202 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 43 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:33,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:33,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2025-03-08 00:54:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7429. [2025-03-08 00:54:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7429 states, 7428 states have (on average 1.2411147011308563) internal successors, (9219), 7428 states have internal predecessors, (9219), 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-08 00:54:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 9219 transitions. [2025-03-08 00:54:33,381 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 9219 transitions. Word has length 25 [2025-03-08 00:54:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:33,381 INFO L471 AbstractCegarLoop]: Abstraction has 7429 states and 9219 transitions. [2025-03-08 00:54:33,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-08 00:54:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 9219 transitions. [2025-03-08 00:54:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:54:33,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:33,387 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] [2025-03-08 00:54:33,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 00:54:33,388 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:33,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash -896243571, now seen corresponding path program 1 times [2025-03-08 00:54:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:33,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317864048] [2025-03-08 00:54:33,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:33,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:33,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:54:33,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:54:33,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:33,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:33,405 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-08 00:54:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317864048] [2025-03-08 00:54:33,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317864048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:33,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:33,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858788656] [2025-03-08 00:54:33,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:33,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:33,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:33,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:33,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:33,406 INFO L87 Difference]: Start difference. First operand 7429 states and 9219 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-08 00:54:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:33,525 INFO L93 Difference]: Finished difference Result 12297 states and 15365 transitions. [2025-03-08 00:54:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:33,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2025-03-08 00:54:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:33,540 INFO L225 Difference]: With dead ends: 12297 [2025-03-08 00:54:33,540 INFO L226 Difference]: Without dead ends: 12295 [2025-03-08 00:54:33,542 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-08 00:54:33,543 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:33,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12295 states. [2025-03-08 00:54:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12295 to 11269. [2025-03-08 00:54:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.2043840965566206) internal successors, (13571), 11268 states have internal predecessors, (13571), 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-08 00:54:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13571 transitions. [2025-03-08 00:54:33,699 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 13571 transitions. Word has length 25 [2025-03-08 00:54:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:33,699 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 13571 transitions. [2025-03-08 00:54:33,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-08 00:54:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 13571 transitions. [2025-03-08 00:54:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:54:33,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:33,707 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] [2025-03-08 00:54:33,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 00:54:33,707 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:33,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:33,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1189646578, now seen corresponding path program 1 times [2025-03-08 00:54:33,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:33,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256298778] [2025-03-08 00:54:33,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:33,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:54:33,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:54:33,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:33,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:33,731 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-08 00:54:33,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:33,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256298778] [2025-03-08 00:54:33,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256298778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:33,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:33,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:33,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190845365] [2025-03-08 00:54:33,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:33,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:33,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:33,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:33,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:33,733 INFO L87 Difference]: Start difference. First operand 11269 states and 13571 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-08 00:54:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:33,876 INFO L93 Difference]: Finished difference Result 25353 states and 30213 transitions. [2025-03-08 00:54:33,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:33,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2025-03-08 00:54:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:33,893 INFO L225 Difference]: With dead ends: 25353 [2025-03-08 00:54:33,894 INFO L226 Difference]: Without dead ends: 14343 [2025-03-08 00:54:33,902 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-08 00:54:33,903 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:33,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2025-03-08 00:54:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 14341. [2025-03-08 00:54:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.1605997210599721) internal successors, (16643), 14340 states have internal predecessors, (16643), 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-08 00:54:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 16643 transitions. [2025-03-08 00:54:34,132 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 16643 transitions. Word has length 25 [2025-03-08 00:54:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:34,132 INFO L471 AbstractCegarLoop]: Abstraction has 14341 states and 16643 transitions. [2025-03-08 00:54:34,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-08 00:54:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 16643 transitions. [2025-03-08 00:54:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:54:34,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:34,140 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] [2025-03-08 00:54:34,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 00:54:34,141 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:34,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:34,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2013720820, now seen corresponding path program 1 times [2025-03-08 00:54:34,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:34,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076585305] [2025-03-08 00:54:34,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:34,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:34,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 00:54:34,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:54:34,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:34,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:34,154 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-08 00:54:34,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076585305] [2025-03-08 00:54:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076585305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:34,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:34,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840619879] [2025-03-08 00:54:34,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:34,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:34,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:34,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:34,155 INFO L87 Difference]: Start difference. First operand 14341 states and 16643 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-08 00:54:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:34,304 INFO L93 Difference]: Finished difference Result 21513 states and 24837 transitions. [2025-03-08 00:54:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:34,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2025-03-08 00:54:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:34,324 INFO L225 Difference]: With dead ends: 21513 [2025-03-08 00:54:34,324 INFO L226 Difference]: Without dead ends: 14599 [2025-03-08 00:54:34,332 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-08 00:54:34,332 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:34,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14599 states. [2025-03-08 00:54:34,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14599 to 14597. [2025-03-08 00:54:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14597 states, 14596 states have (on average 1.1402439024390243) internal successors, (16643), 14596 states have internal predecessors, (16643), 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-08 00:54:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14597 states to 14597 states and 16643 transitions. [2025-03-08 00:54:34,639 INFO L78 Accepts]: Start accepts. Automaton has 14597 states and 16643 transitions. Word has length 26 [2025-03-08 00:54:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:34,640 INFO L471 AbstractCegarLoop]: Abstraction has 14597 states and 16643 transitions. [2025-03-08 00:54:34,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-08 00:54:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 14597 states and 16643 transitions. [2025-03-08 00:54:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:54:34,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:34,651 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] [2025-03-08 00:54:34,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 00:54:34,651 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:34,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1775687851, now seen corresponding path program 1 times [2025-03-08 00:54:34,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:34,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460660958] [2025-03-08 00:54:34,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 00:54:34,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:54:34,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:34,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:34,667 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-08 00:54:34,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:34,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460660958] [2025-03-08 00:54:34,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460660958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:34,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:34,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279957832] [2025-03-08 00:54:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:34,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:34,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:34,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:34,668 INFO L87 Difference]: Start difference. First operand 14597 states and 16643 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-08 00:54:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:34,943 INFO L93 Difference]: Finished difference Result 23559 states and 26628 transitions. [2025-03-08 00:54:34,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:34,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2025-03-08 00:54:34,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:34,972 INFO L225 Difference]: With dead ends: 23559 [2025-03-08 00:54:34,972 INFO L226 Difference]: Without dead ends: 23557 [2025-03-08 00:54:34,975 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-08 00:54:34,975 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:34,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23557 states. [2025-03-08 00:54:35,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23557 to 22533. [2025-03-08 00:54:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.11357180898278) internal successors, (25091), 22532 states have internal predecessors, (25091), 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-08 00:54:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 25091 transitions. [2025-03-08 00:54:35,211 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 25091 transitions. Word has length 26 [2025-03-08 00:54:35,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:35,212 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 25091 transitions. [2025-03-08 00:54:35,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-08 00:54:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 25091 transitions. [2025-03-08 00:54:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:54:35,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:35,225 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] [2025-03-08 00:54:35,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 00:54:35,226 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:35,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:35,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1482284844, now seen corresponding path program 1 times [2025-03-08 00:54:35,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:35,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289744323] [2025-03-08 00:54:35,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:35,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 00:54:35,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:54:35,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:35,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:35,239 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-08 00:54:35,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:35,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289744323] [2025-03-08 00:54:35,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289744323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:35,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:35,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:35,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240483706] [2025-03-08 00:54:35,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:35,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:35,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:35,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:35,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:35,240 INFO L87 Difference]: Start difference. First operand 22533 states and 25091 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-08 00:54:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:35,504 INFO L93 Difference]: Finished difference Result 50181 states and 54787 transitions. [2025-03-08 00:54:35,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:35,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2025-03-08 00:54:35,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:35,506 INFO L225 Difference]: With dead ends: 50181 [2025-03-08 00:54:35,506 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:54:35,522 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-08 00:54:35,523 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:35,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:54:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:54:35,524 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-08 00:54:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:54:35,525 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-03-08 00:54:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:35,525 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:54:35,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-08 00:54:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:54:35,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:54:35,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:54:35,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 00:54:35,529 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:35,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:54:35,540 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:54:35,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:54:35 BoogieIcfgContainer [2025-03-08 00:54:35,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:54:35,547 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:54:35,547 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:54:35,547 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:54:35,547 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:30" (3/4) ... [2025-03-08 00:54:35,548 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:54:35,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-08 00:54:35,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:54:35,555 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:54:35,555 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:54:35,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:54:35,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:54:35,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:54:35,610 INFO L158 Benchmark]: Toolchain (without parser) took 5685.34ms. Allocated memory was 142.6MB in the beginning and 864.0MB in the end (delta: 721.4MB). Free memory was 110.2MB in the beginning and 463.3MB in the end (delta: -353.2MB). Peak memory consumption was 364.8MB. Max. memory is 16.1GB. [2025-03-08 00:54:35,611 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 201.3MB. Free memory was 127.7MB in the beginning and 127.4MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:35,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.70ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 98.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:54:35,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.92ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 97.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:54:35,612 INFO L158 Benchmark]: Boogie Preprocessor took 22.44ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 96.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:35,612 INFO L158 Benchmark]: IcfgBuilder took 264.43ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 80.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:54:35,612 INFO L158 Benchmark]: TraceAbstraction took 5161.55ms. Allocated memory was 142.6MB in the beginning and 864.0MB in the end (delta: 721.4MB). Free memory was 80.4MB in the beginning and 471.7MB in the end (delta: -391.3MB). Peak memory consumption was 331.2MB. Max. memory is 16.1GB. [2025-03-08 00:54:35,612 INFO L158 Benchmark]: Witness Printer took 63.05ms. Allocated memory is still 864.0MB. Free memory was 471.7MB in the beginning and 463.3MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:35,613 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.79ms. Allocated memory is still 201.3MB. Free memory was 127.7MB in the beginning and 127.4MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.70ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 98.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.92ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 97.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.44ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 96.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 264.43ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 80.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5161.55ms. Allocated memory was 142.6MB in the beginning and 864.0MB in the end (delta: 721.4MB). Free memory was 80.4MB in the beginning and 471.7MB in the end (delta: -391.3MB). Peak memory consumption was 331.2MB. Max. memory is 16.1GB. * Witness Printer took 63.05ms. Allocated memory is still 864.0MB. Free memory was 471.7MB in the beginning and 463.3MB in the end (delta: 8.4MB). There was no memory consumed. 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: 163]: 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, 40 locations, 71 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1194 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1194 mSDsluCounter, 3958 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1588 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 2370 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22533occurred in iteration=28, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 4126 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 599 ConstructedInterpolants, 0 QuantifiedInterpolants, 1289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be correct! [2025-03-08 00:54:35,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE