./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_13.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_13.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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:54:39,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:54:39,835 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:39,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:54:39,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:54:39,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:54:39,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:54:39,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:54:39,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:54:39,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:54:39,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:54:39,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:54:39,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:54:39,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:54:39,867 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:54:39,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:54:39,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:54:39,868 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:54:39,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:54:39,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:54:39,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:54:39,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:54:39,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:54:39,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:54:39,868 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:54:39,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:54:39,869 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:54:39,869 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:54:39,869 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:54:39,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:54:39,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:54:39,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:54:39,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:54:39,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:54:39,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:54:39,870 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:54:39,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:54:39,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:54:39,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:54:39,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:54:39,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:54:39,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:54:39,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:54:39,870 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2025-03-08 00:54:40,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:54:40,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:54:40,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:54:40,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:54:40,098 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:54:40,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2025-03-08 00:54:41,267 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4133fe098/a042e2d039ac4c7cb2a0ad441d69990a/FLAG8522a3ad6 [2025-03-08 00:54:41,486 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:54:41,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2025-03-08 00:54:41,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4133fe098/a042e2d039ac4c7cb2a0ad441d69990a/FLAG8522a3ad6 [2025-03-08 00:54:41,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4133fe098/a042e2d039ac4c7cb2a0ad441d69990a [2025-03-08 00:54:41,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:54:41,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:54:41,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:54:41,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:54:41,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:54:41,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:41" (1/1) ... [2025-03-08 00:54:41,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ce3282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:41, skipping insertion in model container [2025-03-08 00:54:41,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:41" (1/1) ... [2025-03-08 00:54:41,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:54:41,971 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_13.c[4936,4949] [2025-03-08 00:54:41,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:54:41,981 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:54:41,996 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_13.c[4936,4949] [2025-03-08 00:54:41,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:54:42,009 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:54:42,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:42 WrapperNode [2025-03-08 00:54:42,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:54:42,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:54:42,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:54:42,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:54:42,014 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:42" (1/1) ... [2025-03-08 00:54:42,018 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:42" (1/1) ... [2025-03-08 00:54:42,028 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 181 [2025-03-08 00:54:42,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:54:42,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:54:42,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:54:42,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:54:42,034 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:42" (1/1) ... [2025-03-08 00:54:42,035 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:42" (1/1) ... [2025-03-08 00:54:42,036 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:42" (1/1) ... [2025-03-08 00:54:42,042 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:42,042 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:42" (1/1) ... [2025-03-08 00:54:42,042 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:42" (1/1) ... [2025-03-08 00:54:42,044 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:42" (1/1) ... [2025-03-08 00:54:42,045 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:42" (1/1) ... [2025-03-08 00:54:42,046 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:42" (1/1) ... [2025-03-08 00:54:42,046 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:42" (1/1) ... [2025-03-08 00:54:42,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:54:42,048 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:54:42,048 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:54:42,048 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:54:42,049 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:42" (1/1) ... [2025-03-08 00:54:42,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:54:42,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:42,069 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:42,071 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:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:54:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:54:42,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:54:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:54:42,134 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:54:42,135 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:54:42,376 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-08 00:54:42,376 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:54:42,383 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:54:42,383 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:54:42,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:42 BoogieIcfgContainer [2025-03-08 00:54:42,384 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:54:42,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:54:42,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:54:42,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:54:42,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:54:41" (1/3) ... [2025-03-08 00:54:42,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cc1797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:42, skipping insertion in model container [2025-03-08 00:54:42,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:42" (2/3) ... [2025-03-08 00:54:42,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cc1797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:42, skipping insertion in model container [2025-03-08 00:54:42,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:42" (3/3) ... [2025-03-08 00:54:42,390 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2025-03-08 00:54:42,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:54:42,400 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_13.c that has 1 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:54:42,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:54:42,439 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;@6d1fa607, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:54:42,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:54:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 48 states have internal predecessors, (89), 0 states have call successors, (0), 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:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:54:42,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:42,446 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:42,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:42,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 798878041, now seen corresponding path program 1 times [2025-03-08 00:54:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:42,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620141470] [2025-03-08 00:54:42,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:42,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 00:54:42,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:54:42,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:42,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:42,629 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:42,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:42,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620141470] [2025-03-08 00:54:42,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620141470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:42,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:42,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893371345] [2025-03-08 00:54:42,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:42,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:42,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:42,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:42,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:42,647 INFO L87 Difference]: Start difference. First operand has 49 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 48 states have internal predecessors, (89), 0 states have call successors, (0), 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 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:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:42,687 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2025-03-08 00:54:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:42,689 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:42,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:42,695 INFO L225 Difference]: With dead ends: 99 [2025-03-08 00:54:42,696 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 00:54:42,697 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:42,699 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 65 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 173 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:42,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 173 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:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 00:54:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2025-03-08 00:54:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 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:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 110 transitions. [2025-03-08 00:54:42,723 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 110 transitions. Word has length 20 [2025-03-08 00:54:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:42,723 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 110 transitions. [2025-03-08 00:54:42,723 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:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 110 transitions. [2025-03-08 00:54:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:54:42,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:42,723 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:42,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:54:42,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:42,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash 288343864, now seen corresponding path program 1 times [2025-03-08 00:54:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:42,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156941741] [2025-03-08 00:54:42,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:42,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:42,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 00:54:42,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:54:42,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:42,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:42,790 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:42,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:42,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156941741] [2025-03-08 00:54:42,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156941741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:42,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:42,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:42,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925259964] [2025-03-08 00:54:42,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:42,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:42,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:42,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:42,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:42,792 INFO L87 Difference]: Start difference. First operand 59 states and 110 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:42,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:42,815 INFO L93 Difference]: Finished difference Result 144 states and 269 transitions. [2025-03-08 00:54:42,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:42,817 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:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:42,818 INFO L225 Difference]: With dead ends: 144 [2025-03-08 00:54:42,818 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 00:54:42,819 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:42,819 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 185 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:42,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 185 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:42,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 00:54:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2025-03-08 00:54:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 158 transitions. [2025-03-08 00:54:42,829 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 158 transitions. Word has length 20 [2025-03-08 00:54:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:42,830 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 158 transitions. [2025-03-08 00:54:42,830 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:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 158 transitions. [2025-03-08 00:54:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:54:42,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:42,831 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:42,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:54:42,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:42,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:42,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1004556013, now seen corresponding path program 1 times [2025-03-08 00:54:42,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:42,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360158740] [2025-03-08 00:54:42,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:42,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:54:42,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:54:42,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:42,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:42,891 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:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:42,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360158740] [2025-03-08 00:54:42,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360158740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:42,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:42,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:42,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788952336] [2025-03-08 00:54:42,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:42,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:42,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:42,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:42,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:42,895 INFO L87 Difference]: Start difference. First operand 85 states and 158 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:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:42,918 INFO L93 Difference]: Finished difference Result 132 states and 240 transitions. [2025-03-08 00:54:42,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:42,919 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:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:42,920 INFO L225 Difference]: With dead ends: 132 [2025-03-08 00:54:42,920 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 00:54:42,920 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:42,921 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 208 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:42,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 208 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:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 00:54:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-08 00:54:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 160 transitions. [2025-03-08 00:54:42,930 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 160 transitions. Word has length 21 [2025-03-08 00:54:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:42,930 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 160 transitions. [2025-03-08 00:54:42,930 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:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 160 transitions. [2025-03-08 00:54:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:54:42,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:42,931 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:42,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:54:42,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:42,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:42,931 INFO L85 PathProgramCache]: Analyzing trace with hash 348753684, now seen corresponding path program 1 times [2025-03-08 00:54:42,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823481861] [2025-03-08 00:54:42,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:42,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:42,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:54:42,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:54:42,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:42,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:42,992 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:42,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:42,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823481861] [2025-03-08 00:54:42,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823481861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:42,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:42,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:42,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212675857] [2025-03-08 00:54:42,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:42,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:42,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:42,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:42,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:42,993 INFO L87 Difference]: Start difference. First operand 88 states and 160 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:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,013 INFO L93 Difference]: Finished difference Result 169 states and 309 transitions. [2025-03-08 00:54:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,014 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:43,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,015 INFO L225 Difference]: With dead ends: 169 [2025-03-08 00:54:43,016 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 00:54:43,016 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:43,017 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 60 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 161 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:43,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 161 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:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 00:54:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2025-03-08 00:54:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 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:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 213 transitions. [2025-03-08 00:54:43,029 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 213 transitions. Word has length 21 [2025-03-08 00:54:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,029 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 213 transitions. [2025-03-08 00:54:43,029 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:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 213 transitions. [2025-03-08 00:54:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:54:43,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,030 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:43,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:54:43,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,030 INFO L85 PathProgramCache]: Analyzing trace with hash -161780493, now seen corresponding path program 1 times [2025-03-08 00:54:43,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132383845] [2025-03-08 00:54:43,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:54:43,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:54:43,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,054 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:43,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132383845] [2025-03-08 00:54:43,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132383845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570769744] [2025-03-08 00:54:43,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,055 INFO L87 Difference]: Start difference. First operand 117 states and 213 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:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,068 INFO L93 Difference]: Finished difference Result 281 states and 515 transitions. [2025-03-08 00:54:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,068 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:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,069 INFO L225 Difference]: With dead ends: 281 [2025-03-08 00:54:43,069 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 00:54:43,069 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:43,070 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 186 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:43,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 186 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:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 00:54:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2025-03-08 00:54:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 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:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 303 transitions. [2025-03-08 00:54:43,077 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 303 transitions. Word has length 21 [2025-03-08 00:54:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,077 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 303 transitions. [2025-03-08 00:54:43,077 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:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 303 transitions. [2025-03-08 00:54:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:54:43,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,078 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:43,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:54:43,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2073509409, now seen corresponding path program 1 times [2025-03-08 00:54:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895437674] [2025-03-08 00:54:43,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 00:54:43,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:54:43,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,105 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:43,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895437674] [2025-03-08 00:54:43,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895437674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945557716] [2025-03-08 00:54:43,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,111 INFO L87 Difference]: Start difference. First operand 167 states and 303 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:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,129 INFO L93 Difference]: Finished difference Result 252 states and 454 transitions. [2025-03-08 00:54:43,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,129 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:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,131 INFO L225 Difference]: With dead ends: 252 [2025-03-08 00:54:43,131 INFO L226 Difference]: Without dead ends: 171 [2025-03-08 00:54:43,132 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:43,132 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 204 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:43,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 204 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:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-08 00:54:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-03-08 00:54:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 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:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 303 transitions. [2025-03-08 00:54:43,146 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 303 transitions. Word has length 22 [2025-03-08 00:54:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,146 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 303 transitions. [2025-03-08 00:54:43,146 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:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 303 transitions. [2025-03-08 00:54:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:54:43,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,147 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:43,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:54:43,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,147 INFO L85 PathProgramCache]: Analyzing trace with hash -720199712, now seen corresponding path program 1 times [2025-03-08 00:54:43,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802262256] [2025-03-08 00:54:43,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 00:54:43,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:54:43,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,185 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:43,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802262256] [2025-03-08 00:54:43,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802262256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337450127] [2025-03-08 00:54:43,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,188 INFO L87 Difference]: Start difference. First operand 169 states and 303 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:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,205 INFO L93 Difference]: Finished difference Result 321 states and 581 transitions. [2025-03-08 00:54:43,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,205 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:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,206 INFO L225 Difference]: With dead ends: 321 [2025-03-08 00:54:43,207 INFO L226 Difference]: Without dead ends: 319 [2025-03-08 00:54:43,207 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:43,209 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 57 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 159 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:43,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 159 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:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-08 00:54:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 229. [2025-03-08 00:54:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.7850877192982457) internal successors, (407), 228 states have internal predecessors, (407), 0 states have call successors, (0), 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:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 407 transitions. [2025-03-08 00:54:43,219 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 407 transitions. Word has length 22 [2025-03-08 00:54:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,220 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 407 transitions. [2025-03-08 00:54:43,220 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:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 407 transitions. [2025-03-08 00:54:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:54:43,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,220 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:43,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:54:43,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1230733889, now seen corresponding path program 1 times [2025-03-08 00:54:43,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325859625] [2025-03-08 00:54:43,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 00:54:43,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:54:43,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,247 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:43,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325859625] [2025-03-08 00:54:43,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325859625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604677202] [2025-03-08 00:54:43,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,249 INFO L87 Difference]: Start difference. First operand 229 states and 407 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:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,266 INFO L93 Difference]: Finished difference Result 549 states and 981 transitions. [2025-03-08 00:54:43,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,267 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:43,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,268 INFO L225 Difference]: With dead ends: 549 [2025-03-08 00:54:43,269 INFO L226 Difference]: Without dead ends: 327 [2025-03-08 00:54:43,270 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:43,270 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 187 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:43,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 187 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:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-08 00:54:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2025-03-08 00:54:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 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:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 575 transitions. [2025-03-08 00:54:43,279 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 575 transitions. Word has length 22 [2025-03-08 00:54:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,280 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 575 transitions. [2025-03-08 00:54:43,280 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:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 575 transitions. [2025-03-08 00:54:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:54:43,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,281 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:43,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:54:43,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,282 INFO L85 PathProgramCache]: Analyzing trace with hash -851326534, now seen corresponding path program 1 times [2025-03-08 00:54:43,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27591248] [2025-03-08 00:54:43,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:54:43,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:54:43,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,311 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:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27591248] [2025-03-08 00:54:43,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27591248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186391479] [2025-03-08 00:54:43,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,313 INFO L87 Difference]: Start difference. First operand 325 states and 575 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:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,331 INFO L93 Difference]: Finished difference Result 489 states and 861 transitions. [2025-03-08 00:54:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,331 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:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,333 INFO L225 Difference]: With dead ends: 489 [2025-03-08 00:54:43,333 INFO L226 Difference]: Without dead ends: 331 [2025-03-08 00:54:43,333 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:43,334 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 63 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 200 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:43,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 200 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:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-08 00:54:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2025-03-08 00:54:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.7530487804878048) internal successors, (575), 328 states have internal predecessors, (575), 0 states have call successors, (0), 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:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 575 transitions. [2025-03-08 00:54:43,346 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 575 transitions. Word has length 23 [2025-03-08 00:54:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,346 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 575 transitions. [2025-03-08 00:54:43,346 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:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 575 transitions. [2025-03-08 00:54:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:54:43,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,348 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:43,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:54:43,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash 501983163, now seen corresponding path program 1 times [2025-03-08 00:54:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208404069] [2025-03-08 00:54:43,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:54:43,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:54:43,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,377 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:43,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208404069] [2025-03-08 00:54:43,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208404069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616313759] [2025-03-08 00:54:43,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,378 INFO L87 Difference]: Start difference. First operand 329 states and 575 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:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,399 INFO L93 Difference]: Finished difference Result 617 states and 1093 transitions. [2025-03-08 00:54:43,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,400 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:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,402 INFO L225 Difference]: With dead ends: 617 [2025-03-08 00:54:43,402 INFO L226 Difference]: Without dead ends: 615 [2025-03-08 00:54:43,402 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:43,402 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 54 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 157 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:43,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 157 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:43,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-03-08 00:54:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 453. [2025-03-08 00:54:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.7234513274336283) internal successors, (779), 452 states have internal predecessors, (779), 0 states have call successors, (0), 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:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 779 transitions. [2025-03-08 00:54:43,429 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 779 transitions. Word has length 23 [2025-03-08 00:54:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,430 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 779 transitions. [2025-03-08 00:54:43,430 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:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 779 transitions. [2025-03-08 00:54:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:54:43,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,431 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:43,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:54:43,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash -8551014, now seen corresponding path program 1 times [2025-03-08 00:54:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112766752] [2025-03-08 00:54:43,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:54:43,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:54:43,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,461 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:43,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112766752] [2025-03-08 00:54:43,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112766752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490090163] [2025-03-08 00:54:43,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,463 INFO L87 Difference]: Start difference. First operand 453 states and 779 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:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,484 INFO L93 Difference]: Finished difference Result 1081 states and 1869 transitions. [2025-03-08 00:54:43,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,484 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:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,486 INFO L225 Difference]: With dead ends: 1081 [2025-03-08 00:54:43,487 INFO L226 Difference]: Without dead ends: 639 [2025-03-08 00:54:43,489 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:43,490 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 60 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 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:43,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 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:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-08 00:54:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 637. [2025-03-08 00:54:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 1.7154088050314464) internal successors, (1091), 636 states have internal predecessors, (1091), 0 states have call successors, (0), 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:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1091 transitions. [2025-03-08 00:54:43,504 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1091 transitions. Word has length 23 [2025-03-08 00:54:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,508 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 1091 transitions. [2025-03-08 00:54:43,508 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:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1091 transitions. [2025-03-08 00:54:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:54:43,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,509 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:43,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 00:54:43,509 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1618363290, now seen corresponding path program 1 times [2025-03-08 00:54:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203552737] [2025-03-08 00:54:43,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:54:43,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:54:43,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,534 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:43,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203552737] [2025-03-08 00:54:43,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203552737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255664946] [2025-03-08 00:54:43,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,537 INFO L87 Difference]: Start difference. First operand 637 states and 1091 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:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,553 INFO L93 Difference]: Finished difference Result 957 states and 1633 transitions. [2025-03-08 00:54:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,554 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:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,556 INFO L225 Difference]: With dead ends: 957 [2025-03-08 00:54:43,556 INFO L226 Difference]: Without dead ends: 647 [2025-03-08 00:54:43,557 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:43,557 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 196 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:43,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 196 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:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-08 00:54:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2025-03-08 00:54:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.6940993788819876) internal successors, (1091), 644 states have internal predecessors, (1091), 0 states have call successors, (0), 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:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1091 transitions. [2025-03-08 00:54:43,574 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1091 transitions. Word has length 24 [2025-03-08 00:54:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,574 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 1091 transitions. [2025-03-08 00:54:43,574 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:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1091 transitions. [2025-03-08 00:54:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:54:43,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,575 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:43,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 00:54:43,576 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash -265053593, now seen corresponding path program 1 times [2025-03-08 00:54:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578524119] [2025-03-08 00:54:43,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:54:43,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:54:43,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,599 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:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578524119] [2025-03-08 00:54:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578524119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235957290] [2025-03-08 00:54:43,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,601 INFO L87 Difference]: Start difference. First operand 645 states and 1091 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:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,623 INFO L93 Difference]: Finished difference Result 1193 states and 2053 transitions. [2025-03-08 00:54:43,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,623 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:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,627 INFO L225 Difference]: With dead ends: 1193 [2025-03-08 00:54:43,627 INFO L226 Difference]: Without dead ends: 1191 [2025-03-08 00:54:43,628 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:43,628 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 51 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 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:43,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 155 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:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2025-03-08 00:54:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 901. [2025-03-08 00:54:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.6566666666666667) internal successors, (1491), 900 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:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1491 transitions. [2025-03-08 00:54:43,652 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1491 transitions. Word has length 24 [2025-03-08 00:54:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,652 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1491 transitions. [2025-03-08 00:54:43,653 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:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1491 transitions. [2025-03-08 00:54:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:54:43,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,654 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:43,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 00:54:43,654 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,654 INFO L85 PathProgramCache]: Analyzing trace with hash -775587770, now seen corresponding path program 1 times [2025-03-08 00:54:43,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461477416] [2025-03-08 00:54:43,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:54:43,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:54:43,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,673 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:43,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461477416] [2025-03-08 00:54:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461477416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464335554] [2025-03-08 00:54:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,674 INFO L87 Difference]: Start difference. First operand 901 states and 1491 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:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,709 INFO L93 Difference]: Finished difference Result 2137 states and 3557 transitions. [2025-03-08 00:54:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,709 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:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,713 INFO L225 Difference]: With dead ends: 2137 [2025-03-08 00:54:43,713 INFO L226 Difference]: Without dead ends: 1255 [2025-03-08 00:54:43,714 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:43,716 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 189 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:43,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 189 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:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-08 00:54:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2025-03-08 00:54:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.650958466453674) internal successors, (2067), 1252 states have internal predecessors, (2067), 0 states have call successors, (0), 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:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2067 transitions. [2025-03-08 00:54:43,744 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2067 transitions. Word has length 24 [2025-03-08 00:54:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,745 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 2067 transitions. [2025-03-08 00:54:43,745 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:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2067 transitions. [2025-03-08 00:54:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:54:43,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,746 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:43,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 00:54:43,747 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash 373300833, now seen corresponding path program 1 times [2025-03-08 00:54:43,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063574692] [2025-03-08 00:54:43,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:54:43,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:54:43,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,770 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:43,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063574692] [2025-03-08 00:54:43,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063574692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733254575] [2025-03-08 00:54:43,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,772 INFO L87 Difference]: Start difference. First operand 1253 states and 2067 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:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,801 INFO L93 Difference]: Finished difference Result 1881 states and 3093 transitions. [2025-03-08 00:54:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,801 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:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,805 INFO L225 Difference]: With dead ends: 1881 [2025-03-08 00:54:43,805 INFO L226 Difference]: Without dead ends: 1271 [2025-03-08 00:54:43,806 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:43,807 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 192 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:43,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 192 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:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-03-08 00:54:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1269. [2025-03-08 00:54:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1268 states have (on average 1.6301261829652998) internal successors, (2067), 1268 states have internal predecessors, (2067), 0 states have call successors, (0), 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:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2067 transitions. [2025-03-08 00:54:43,842 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2067 transitions. Word has length 25 [2025-03-08 00:54:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,843 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 2067 transitions. [2025-03-08 00:54:43,843 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:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2067 transitions. [2025-03-08 00:54:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:54:43,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:43,844 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:43,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 00:54:43,844 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:43,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1726610530, now seen corresponding path program 1 times [2025-03-08 00:54:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:43,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251294158] [2025-03-08 00:54:43,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:43,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:54:43,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:54:43,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:43,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:43,867 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:43,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:43,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251294158] [2025-03-08 00:54:43,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251294158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:43,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:43,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765306494] [2025-03-08 00:54:43,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:43,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:43,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:43,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:43,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:43,870 INFO L87 Difference]: Start difference. First operand 1269 states and 2067 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:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:43,916 INFO L93 Difference]: Finished difference Result 3705 states and 6005 transitions. [2025-03-08 00:54:43,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:43,916 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:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:43,923 INFO L225 Difference]: With dead ends: 3705 [2025-03-08 00:54:43,923 INFO L226 Difference]: Without dead ends: 2471 [2025-03-08 00:54:43,925 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:43,926 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 163 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:43,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 163 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:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2025-03-08 00:54:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2469. [2025-03-08 00:54:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2468 states have (on average 1.5960291734197731) internal successors, (3939), 2468 states have internal predecessors, (3939), 0 states have call successors, (0), 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:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3939 transitions. [2025-03-08 00:54:43,997 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3939 transitions. Word has length 25 [2025-03-08 00:54:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:43,997 INFO L471 AbstractCegarLoop]: Abstraction has 2469 states and 3939 transitions. [2025-03-08 00:54:43,998 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:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3939 transitions. [2025-03-08 00:54:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:54:44,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:44,001 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:44,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 00:54:44,001 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:44,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:44,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2057822589, now seen corresponding path program 1 times [2025-03-08 00:54:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:44,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285775946] [2025-03-08 00:54:44,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:44,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:44,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:54:44,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:54:44,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:44,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:44,029 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:44,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:44,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285775946] [2025-03-08 00:54:44,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285775946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:44,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:44,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:44,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672362460] [2025-03-08 00:54:44,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:44,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:44,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:44,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:44,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:44,030 INFO L87 Difference]: Start difference. First operand 2469 states and 3939 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:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:44,081 INFO L93 Difference]: Finished difference Result 2985 states and 4901 transitions. [2025-03-08 00:54:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:44,082 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:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:44,091 INFO L225 Difference]: With dead ends: 2985 [2025-03-08 00:54:44,091 INFO L226 Difference]: Without dead ends: 2983 [2025-03-08 00:54:44,092 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:44,092 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 48 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:44,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 209 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2025-03-08 00:54:44,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2469. [2025-03-08 00:54:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2468 states have (on average 1.5830632090761751) internal successors, (3907), 2468 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:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3907 transitions. [2025-03-08 00:54:44,165 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3907 transitions. Word has length 25 [2025-03-08 00:54:44,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:44,165 INFO L471 AbstractCegarLoop]: Abstraction has 2469 states and 3907 transitions. [2025-03-08 00:54:44,165 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:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3907 transitions. [2025-03-08 00:54:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:54:44,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:44,168 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:44,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 00:54:44,168 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:44,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1985346285, now seen corresponding path program 1 times [2025-03-08 00:54:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:44,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426181095] [2025-03-08 00:54:44,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:44,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 00:54:44,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:54:44,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:44,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:44,193 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:44,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:44,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426181095] [2025-03-08 00:54:44,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426181095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:44,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:44,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:44,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154368262] [2025-03-08 00:54:44,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:44,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:44,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:44,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:44,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:44,194 INFO L87 Difference]: Start difference. First operand 2469 states and 3907 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:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:44,255 INFO L93 Difference]: Finished difference Result 4457 states and 7205 transitions. [2025-03-08 00:54:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:44,255 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:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:44,268 INFO L225 Difference]: With dead ends: 4457 [2025-03-08 00:54:44,268 INFO L226 Difference]: Without dead ends: 4455 [2025-03-08 00:54:44,270 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:44,271 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 151 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:44,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 151 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:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4455 states. [2025-03-08 00:54:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4455 to 3557. [2025-03-08 00:54:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.5396512935883016) internal successors, (5475), 3556 states have internal predecessors, (5475), 0 states have call successors, (0), 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:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5475 transitions. [2025-03-08 00:54:44,366 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5475 transitions. Word has length 26 [2025-03-08 00:54:44,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:44,366 INFO L471 AbstractCegarLoop]: Abstraction has 3557 states and 5475 transitions. [2025-03-08 00:54:44,366 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:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5475 transitions. [2025-03-08 00:54:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:54:44,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:44,370 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:44,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 00:54:44,370 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:44,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:44,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1474812108, now seen corresponding path program 1 times [2025-03-08 00:54:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748564371] [2025-03-08 00:54:44,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:44,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 00:54:44,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:54:44,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:44,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:44,394 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:44,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:44,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748564371] [2025-03-08 00:54:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748564371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:44,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:44,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644835900] [2025-03-08 00:54:44,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:44,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:44,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:44,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:44,396 INFO L87 Difference]: Start difference. First operand 3557 states and 5475 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:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:44,470 INFO L93 Difference]: Finished difference Result 8361 states and 12965 transitions. [2025-03-08 00:54:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:44,471 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:44,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:44,483 INFO L225 Difference]: With dead ends: 8361 [2025-03-08 00:54:44,483 INFO L226 Difference]: Without dead ends: 4839 [2025-03-08 00:54:44,487 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:44,488 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 191 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:44,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 191 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:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2025-03-08 00:54:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 4837. [2025-03-08 00:54:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4837 states, 4836 states have (on average 1.5357733664185278) internal successors, (7427), 4836 states have internal predecessors, (7427), 0 states have call successors, (0), 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:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4837 states to 4837 states and 7427 transitions. [2025-03-08 00:54:44,588 INFO L78 Accepts]: Start accepts. Automaton has 4837 states and 7427 transitions. Word has length 26 [2025-03-08 00:54:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:44,588 INFO L471 AbstractCegarLoop]: Abstraction has 4837 states and 7427 transitions. [2025-03-08 00:54:44,588 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:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4837 states and 7427 transitions. [2025-03-08 00:54:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:54:44,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:44,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:44,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 00:54:44,592 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:44,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1416219881, now seen corresponding path program 1 times [2025-03-08 00:54:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:44,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185779270] [2025-03-08 00:54:44,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:44,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:44,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:54:44,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:54:44,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:44,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:44,612 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:44,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:44,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185779270] [2025-03-08 00:54:44,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185779270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:44,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:44,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664124926] [2025-03-08 00:54:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:44,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:44,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:44,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:44,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:44,614 INFO L87 Difference]: Start difference. First operand 4837 states and 7427 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:44,666 INFO L93 Difference]: Finished difference Result 7305 states and 11205 transitions. [2025-03-08 00:54:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:44,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-08 00:54:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:44,689 INFO L225 Difference]: With dead ends: 7305 [2025-03-08 00:54:44,689 INFO L226 Difference]: Without dead ends: 4935 [2025-03-08 00:54:44,693 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:44,694 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 184 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:44,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 184 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:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2025-03-08 00:54:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4933. [2025-03-08 00:54:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 0 states have call successors, (0), 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:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4933 states to 4933 states and 7491 transitions. [2025-03-08 00:54:44,806 INFO L78 Accepts]: Start accepts. Automaton has 4933 states and 7491 transitions. Word has length 27 [2025-03-08 00:54:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:44,807 INFO L471 AbstractCegarLoop]: Abstraction has 4933 states and 7491 transitions. [2025-03-08 00:54:44,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4933 states and 7491 transitions. [2025-03-08 00:54:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:54:44,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:44,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:44,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 00:54:44,810 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:44,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1525437718, now seen corresponding path program 1 times [2025-03-08 00:54:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:44,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922000779] [2025-03-08 00:54:44,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:44,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:54:44,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:54:44,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:44,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:44,828 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:44,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:44,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922000779] [2025-03-08 00:54:44,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922000779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:44,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:44,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:44,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923790922] [2025-03-08 00:54:44,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:44,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:44,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:44,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:44,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:44,831 INFO L87 Difference]: Start difference. First operand 4933 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:44,926 INFO L93 Difference]: Finished difference Result 8713 states and 13509 transitions. [2025-03-08 00:54:44,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:44,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-08 00:54:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:44,941 INFO L225 Difference]: With dead ends: 8713 [2025-03-08 00:54:44,942 INFO L226 Difference]: Without dead ends: 8711 [2025-03-08 00:54:44,943 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:44,943 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 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:44,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 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:44,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8711 states. [2025-03-08 00:54:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8711 to 7173. [2025-03-08 00:54:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 0 states have call successors, (0), 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:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 10563 transitions. [2025-03-08 00:54:45,075 INFO L78 Accepts]: Start accepts. Automaton has 7173 states and 10563 transitions. Word has length 27 [2025-03-08 00:54:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:45,075 INFO L471 AbstractCegarLoop]: Abstraction has 7173 states and 10563 transitions. [2025-03-08 00:54:45,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 7173 states and 10563 transitions. [2025-03-08 00:54:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:54:45,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:45,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:45,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 00:54:45,081 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:45,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:45,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2035971895, now seen corresponding path program 1 times [2025-03-08 00:54:45,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:45,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63971384] [2025-03-08 00:54:45,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:45,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:45,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:54:45,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:54:45,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:45,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:45,098 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:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63971384] [2025-03-08 00:54:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63971384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:45,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:45,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:45,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145629085] [2025-03-08 00:54:45,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:45,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:45,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:45,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:45,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:45,102 INFO L87 Difference]: Start difference. First operand 7173 states and 10563 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:45,184 INFO L93 Difference]: Finished difference Result 16649 states and 24645 transitions. [2025-03-08 00:54:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:45,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-08 00:54:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:45,198 INFO L225 Difference]: With dead ends: 16649 [2025-03-08 00:54:45,199 INFO L226 Difference]: Without dead ends: 9607 [2025-03-08 00:54:45,207 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:45,208 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 192 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:45,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 192 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:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9607 states. [2025-03-08 00:54:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9607 to 9605. [2025-03-08 00:54:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 0 states have call successors, (0), 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:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9605 states to 9605 states and 14083 transitions. [2025-03-08 00:54:45,386 INFO L78 Accepts]: Start accepts. Automaton has 9605 states and 14083 transitions. Word has length 27 [2025-03-08 00:54:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:45,386 INFO L471 AbstractCegarLoop]: Abstraction has 9605 states and 14083 transitions. [2025-03-08 00:54:45,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 9605 states and 14083 transitions. [2025-03-08 00:54:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:54:45,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:45,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:45,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 00:54:45,392 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:45,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash -43902029, now seen corresponding path program 1 times [2025-03-08 00:54:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:45,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971092240] [2025-03-08 00:54:45,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:45,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:45,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 00:54:45,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:54:45,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:45,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:45,409 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:45,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:45,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971092240] [2025-03-08 00:54:45,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971092240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:45,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:45,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:45,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770197246] [2025-03-08 00:54:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:45,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:45,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:45,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:45,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:45,411 INFO L87 Difference]: Start difference. First operand 9605 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:45,485 INFO L93 Difference]: Finished difference Result 14409 states and 21061 transitions. [2025-03-08 00:54:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:45,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-08 00:54:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:45,501 INFO L225 Difference]: With dead ends: 14409 [2025-03-08 00:54:45,501 INFO L226 Difference]: Without dead ends: 9735 [2025-03-08 00:54:45,508 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:45,509 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 58 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 180 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:45,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 180 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:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2025-03-08 00:54:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9733. [2025-03-08 00:54:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 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:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9733 states to 9733 states and 14083 transitions. [2025-03-08 00:54:45,760 INFO L78 Accepts]: Start accepts. Automaton has 9733 states and 14083 transitions. Word has length 28 [2025-03-08 00:54:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:45,760 INFO L471 AbstractCegarLoop]: Abstraction has 9733 states and 14083 transitions. [2025-03-08 00:54:45,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 9733 states and 14083 transitions. [2025-03-08 00:54:45,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:54:45,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:45,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:45,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 00:54:45,769 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:45,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:45,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1309407668, now seen corresponding path program 1 times [2025-03-08 00:54:45,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:45,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242586978] [2025-03-08 00:54:45,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:45,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:45,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 00:54:45,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:54:45,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:45,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:45,794 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:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242586978] [2025-03-08 00:54:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242586978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:45,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:45,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727582457] [2025-03-08 00:54:45,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:45,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:45,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:45,796 INFO L87 Difference]: Start difference. First operand 9733 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:45,946 INFO L93 Difference]: Finished difference Result 16905 states and 24965 transitions. [2025-03-08 00:54:45,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:45,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-08 00:54:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:45,971 INFO L225 Difference]: With dead ends: 16905 [2025-03-08 00:54:45,972 INFO L226 Difference]: Without dead ends: 16903 [2025-03-08 00:54:45,978 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:45,979 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 147 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:45,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 147 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:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2025-03-08 00:54:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 14341. [2025-03-08 00:54:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.4016039051603906) internal successors, (20099), 14340 states have internal predecessors, (20099), 0 states have call successors, (0), 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:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 20099 transitions. [2025-03-08 00:54:46,207 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 20099 transitions. Word has length 28 [2025-03-08 00:54:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:46,207 INFO L471 AbstractCegarLoop]: Abstraction has 14341 states and 20099 transitions. [2025-03-08 00:54:46,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 20099 transitions. [2025-03-08 00:54:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:54:46,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:46,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:46,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 00:54:46,219 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:46,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash 798873491, now seen corresponding path program 1 times [2025-03-08 00:54:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:46,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485494889] [2025-03-08 00:54:46,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:46,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 00:54:46,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:54:46,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:46,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:46,243 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:46,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:46,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485494889] [2025-03-08 00:54:46,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485494889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:46,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:46,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:46,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410391659] [2025-03-08 00:54:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:46,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:46,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:46,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:46,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:46,244 INFO L87 Difference]: Start difference. First operand 14341 states and 20099 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:46,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:46,369 INFO L93 Difference]: Finished difference Result 33033 states and 46469 transitions. [2025-03-08 00:54:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:46,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-08 00:54:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:46,397 INFO L225 Difference]: With dead ends: 33033 [2025-03-08 00:54:46,397 INFO L226 Difference]: Without dead ends: 18951 [2025-03-08 00:54:46,414 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:46,414 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 193 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:46,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 193 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:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18951 states. [2025-03-08 00:54:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18951 to 18949. [2025-03-08 00:54:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18949 states, 18948 states have (on average 1.3917563858982478) internal successors, (26371), 18948 states have internal predecessors, (26371), 0 states have call successors, (0), 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:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18949 states to 18949 states and 26371 transitions. [2025-03-08 00:54:46,686 INFO L78 Accepts]: Start accepts. Automaton has 18949 states and 26371 transitions. Word has length 28 [2025-03-08 00:54:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:46,687 INFO L471 AbstractCegarLoop]: Abstraction has 18949 states and 26371 transitions. [2025-03-08 00:54:46,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 18949 states and 26371 transitions. [2025-03-08 00:54:46,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:54:46,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:46,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:46,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 00:54:46,699 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:46,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1936958800, now seen corresponding path program 1 times [2025-03-08 00:54:46,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:46,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633035715] [2025-03-08 00:54:46,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:46,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:54:46,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:54:46,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:46,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:46,713 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:46,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:46,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633035715] [2025-03-08 00:54:46,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633035715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:46,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:46,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:46,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731588609] [2025-03-08 00:54:46,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:46,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:46,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:46,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:46,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:46,714 INFO L87 Difference]: Start difference. First operand 18949 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:46,890 INFO L93 Difference]: Finished difference Result 28425 states and 39429 transitions. [2025-03-08 00:54:46,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:46,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 00:54:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:46,918 INFO L225 Difference]: With dead ends: 28425 [2025-03-08 00:54:46,918 INFO L226 Difference]: Without dead ends: 19207 [2025-03-08 00:54:46,926 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:46,926 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 176 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:46,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 176 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:46,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19207 states. [2025-03-08 00:54:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19207 to 19205. [2025-03-08 00:54:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19205 states, 19204 states have (on average 1.3732034992709852) internal successors, (26371), 19204 states have internal predecessors, (26371), 0 states have call successors, (0), 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:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19205 states to 19205 states and 26371 transitions. [2025-03-08 00:54:47,254 INFO L78 Accepts]: Start accepts. Automaton has 19205 states and 26371 transitions. Word has length 29 [2025-03-08 00:54:47,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:47,254 INFO L471 AbstractCegarLoop]: Abstraction has 19205 states and 26371 transitions. [2025-03-08 00:54:47,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 19205 states and 26371 transitions. [2025-03-08 00:54:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:54:47,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:47,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:47,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 00:54:47,269 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:47,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:47,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1004698799, now seen corresponding path program 1 times [2025-03-08 00:54:47,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:47,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231076636] [2025-03-08 00:54:47,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:47,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:47,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:54:47,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:54:47,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:47,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:47,287 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:47,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:47,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231076636] [2025-03-08 00:54:47,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231076636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:47,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:47,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324550995] [2025-03-08 00:54:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:47,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:47,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:47,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:47,288 INFO L87 Difference]: Start difference. First operand 19205 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:47,642 INFO L93 Difference]: Finished difference Result 32777 states and 45829 transitions. [2025-03-08 00:54:47,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:47,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 00:54:47,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:47,701 INFO L225 Difference]: With dead ends: 32777 [2025-03-08 00:54:47,702 INFO L226 Difference]: Without dead ends: 32775 [2025-03-08 00:54:47,713 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:47,713 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 145 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:47,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 145 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:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32775 states. [2025-03-08 00:54:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32775 to 28677. [2025-03-08 00:54:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28677 states, 28676 states have (on average 1.3302761891477193) internal successors, (38147), 28676 states have internal predecessors, (38147), 0 states have call successors, (0), 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:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28677 states to 28677 states and 38147 transitions. [2025-03-08 00:54:48,320 INFO L78 Accepts]: Start accepts. Automaton has 28677 states and 38147 transitions. Word has length 29 [2025-03-08 00:54:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:48,321 INFO L471 AbstractCegarLoop]: Abstraction has 28677 states and 38147 transitions. [2025-03-08 00:54:48,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 28677 states and 38147 transitions. [2025-03-08 00:54:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:54:48,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:48,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:48,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 00:54:48,336 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:48,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:48,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1515232976, now seen corresponding path program 1 times [2025-03-08 00:54:48,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:48,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362130647] [2025-03-08 00:54:48,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:48,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:48,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:54:48,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:54:48,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:48,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:48,362 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:48,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362130647] [2025-03-08 00:54:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362130647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:48,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55781367] [2025-03-08 00:54:48,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:48,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:48,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:48,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:48,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:48,364 INFO L87 Difference]: Start difference. First operand 28677 states and 38147 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:48,709 INFO L93 Difference]: Finished difference Result 65545 states and 87301 transitions. [2025-03-08 00:54:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:48,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 00:54:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:48,760 INFO L225 Difference]: With dead ends: 65545 [2025-03-08 00:54:48,761 INFO L226 Difference]: Without dead ends: 37383 [2025-03-08 00:54:48,785 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:48,786 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 194 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:48,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 194 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:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37383 states. [2025-03-08 00:54:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37383 to 37381. [2025-03-08 00:54:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37381 states, 37380 states have (on average 1.315008025682183) internal successors, (49155), 37380 states have internal predecessors, (49155), 0 states have call successors, (0), 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:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37381 states to 37381 states and 49155 transitions. [2025-03-08 00:54:49,318 INFO L78 Accepts]: Start accepts. Automaton has 37381 states and 49155 transitions. Word has length 29 [2025-03-08 00:54:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:49,319 INFO L471 AbstractCegarLoop]: Abstraction has 37381 states and 49155 transitions. [2025-03-08 00:54:49,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:54:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 37381 states and 49155 transitions. [2025-03-08 00:54:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:54:49,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:49,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:49,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 00:54:49,334 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:49,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:49,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1080865158, now seen corresponding path program 1 times [2025-03-08 00:54:49,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:49,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360194922] [2025-03-08 00:54:49,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:49,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:49,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 00:54:49,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:54:49,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:49,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:49,347 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:49,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:49,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360194922] [2025-03-08 00:54:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360194922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:49,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:49,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078936298] [2025-03-08 00:54:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:49,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:49,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:49,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:49,348 INFO L87 Difference]: Start difference. First operand 37381 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:49,588 INFO L93 Difference]: Finished difference Result 56073 states and 73477 transitions. [2025-03-08 00:54:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:49,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-08 00:54:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:49,625 INFO L225 Difference]: With dead ends: 56073 [2025-03-08 00:54:49,625 INFO L226 Difference]: Without dead ends: 37895 [2025-03-08 00:54:49,642 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:49,642 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 172 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:49,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 172 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:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37895 states. [2025-03-08 00:54:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37895 to 37893. [2025-03-08 00:54:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37893 states, 37892 states have (on average 1.2972395228544285) internal successors, (49155), 37892 states have internal predecessors, (49155), 0 states have call successors, (0), 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:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37893 states to 37893 states and 49155 transitions. [2025-03-08 00:54:50,477 INFO L78 Accepts]: Start accepts. Automaton has 37893 states and 49155 transitions. Word has length 30 [2025-03-08 00:54:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:50,477 INFO L471 AbstractCegarLoop]: Abstraction has 37893 states and 49155 transitions. [2025-03-08 00:54:50,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 37893 states and 49155 transitions. [2025-03-08 00:54:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:54:50,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:50,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:50,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 00:54:50,492 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:50,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:50,492 INFO L85 PathProgramCache]: Analyzing trace with hash 272444539, now seen corresponding path program 1 times [2025-03-08 00:54:50,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:50,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843944289] [2025-03-08 00:54:50,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:50,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:50,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 00:54:50,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:54:50,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:50,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:50,506 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:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843944289] [2025-03-08 00:54:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843944289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:50,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:50,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:50,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287066896] [2025-03-08 00:54:50,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:50,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:50,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:50,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:50,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:50,507 INFO L87 Difference]: Start difference. First operand 37893 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:51,088 INFO L93 Difference]: Finished difference Result 63497 states and 83461 transitions. [2025-03-08 00:54:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-08 00:54:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:51,157 INFO L225 Difference]: With dead ends: 63497 [2025-03-08 00:54:51,157 INFO L226 Difference]: Without dead ends: 63495 [2025-03-08 00:54:51,176 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:51,176 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 33 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 143 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:51,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 143 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:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63495 states. [2025-03-08 00:54:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63495 to 57349. [2025-03-08 00:54:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57349 states, 57348 states have (on average 1.2588930738648252) internal successors, (72195), 57348 states have internal predecessors, (72195), 0 states have call successors, (0), 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:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57349 states to 57349 states and 72195 transitions. [2025-03-08 00:54:51,964 INFO L78 Accepts]: Start accepts. Automaton has 57349 states and 72195 transitions. Word has length 30 [2025-03-08 00:54:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:51,964 INFO L471 AbstractCegarLoop]: Abstraction has 57349 states and 72195 transitions. [2025-03-08 00:54:51,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 57349 states and 72195 transitions. [2025-03-08 00:54:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:54:51,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:51,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:51,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 00:54:51,989 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:51,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash -238089638, now seen corresponding path program 1 times [2025-03-08 00:54:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839188363] [2025-03-08 00:54:51,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:51,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 00:54:51,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:54:51,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:51,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:52,004 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:52,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:52,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839188363] [2025-03-08 00:54:52,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839188363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:52,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:52,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:52,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374688419] [2025-03-08 00:54:52,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:52,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:52,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:52,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:52,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:52,005 INFO L87 Difference]: Start difference. First operand 57349 states and 72195 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:52,658 INFO L93 Difference]: Finished difference Result 130057 states and 163333 transitions. [2025-03-08 00:54:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:52,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-08 00:54:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:52,728 INFO L225 Difference]: With dead ends: 130057 [2025-03-08 00:54:52,728 INFO L226 Difference]: Without dead ends: 73735 [2025-03-08 00:54:52,761 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:52,762 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 53 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 195 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:52,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 195 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:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73735 states. [2025-03-08 00:54:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73735 to 73733. [2025-03-08 00:54:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2360847393262084) internal successors, (91139), 73732 states have internal predecessors, (91139), 0 states have call successors, (0), 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:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 91139 transitions. [2025-03-08 00:54:54,405 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 91139 transitions. Word has length 30 [2025-03-08 00:54:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:54,405 INFO L471 AbstractCegarLoop]: Abstraction has 73733 states and 91139 transitions. [2025-03-08 00:54:54,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 91139 transitions. [2025-03-08 00:54:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:54:54,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:54,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:54,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 00:54:54,427 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:54,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash -144127561, now seen corresponding path program 1 times [2025-03-08 00:54:54,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:54,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935440793] [2025-03-08 00:54:54,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:54,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:54,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:54:54,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:54:54,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:54,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:54,442 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:54,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:54,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935440793] [2025-03-08 00:54:54,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935440793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:54,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:54,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:54,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706859174] [2025-03-08 00:54:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:54,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:54,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:54,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:54,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:54,444 INFO L87 Difference]: Start difference. First operand 73733 states and 91139 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:55,005 INFO L93 Difference]: Finished difference Result 110601 states and 136197 transitions. [2025-03-08 00:54:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:55,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-08 00:54:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:55,071 INFO L225 Difference]: With dead ends: 110601 [2025-03-08 00:54:55,071 INFO L226 Difference]: Without dead ends: 74759 [2025-03-08 00:54:55,094 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:55,095 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 55 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 168 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:55,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 168 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:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74759 states. [2025-03-08 00:54:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74759 to 74757. [2025-03-08 00:54:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74757 states, 74756 states have (on average 1.2191529776874097) internal successors, (91139), 74756 states have internal predecessors, (91139), 0 states have call successors, (0), 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:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74757 states to 74757 states and 91139 transitions. [2025-03-08 00:54:56,367 INFO L78 Accepts]: Start accepts. Automaton has 74757 states and 91139 transitions. Word has length 31 [2025-03-08 00:54:56,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:56,367 INFO L471 AbstractCegarLoop]: Abstraction has 74757 states and 91139 transitions. [2025-03-08 00:54:56,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 74757 states and 91139 transitions. [2025-03-08 00:54:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:54:56,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:56,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:56,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 00:54:56,403 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:56,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1209182136, now seen corresponding path program 1 times [2025-03-08 00:54:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:56,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901223435] [2025-03-08 00:54:56,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:56,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:54:56,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:54:56,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:56,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:56,418 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:56,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:56,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901223435] [2025-03-08 00:54:56,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901223435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:56,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:56,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:54:56,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164161844] [2025-03-08 00:54:56,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:56,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:54:56,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:56,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:54:56,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:54:56,419 INFO L87 Difference]: Start difference. First operand 74757 states and 91139 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:57,756 INFO L93 Difference]: Finished difference Result 122889 states and 150533 transitions. [2025-03-08 00:54:57,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:54:57,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-08 00:54:57,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:57,897 INFO L225 Difference]: With dead ends: 122889 [2025-03-08 00:54:57,897 INFO L226 Difference]: Without dead ends: 122887 [2025-03-08 00:54:57,920 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:57,920 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 141 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:57,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 141 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:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122887 states. [2025-03-08 00:54:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122887 to 114693. [2025-03-08 00:54:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114693 states, 114692 states have (on average 1.1874847417431034) internal successors, (136195), 114692 states have internal predecessors, (136195), 0 states have call successors, (0), 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:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114693 states to 114693 states and 136195 transitions. [2025-03-08 00:54:59,878 INFO L78 Accepts]: Start accepts. Automaton has 114693 states and 136195 transitions. Word has length 31 [2025-03-08 00:54:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:59,879 INFO L471 AbstractCegarLoop]: Abstraction has 114693 states and 136195 transitions. [2025-03-08 00:54:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 114693 states and 136195 transitions. [2025-03-08 00:55:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:55:00,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:00,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:00,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 00:55:00,070 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:00,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash 698647959, now seen corresponding path program 1 times [2025-03-08 00:55:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:00,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342183785] [2025-03-08 00:55:00,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:00,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:00,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:55:00,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:55:00,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:00,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:00,082 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:55:00,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:00,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342183785] [2025-03-08 00:55:00,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342183785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:00,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:55:00,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:55:00,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63534989] [2025-03-08 00:55:00,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:00,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:00,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:00,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:55:00,083 INFO L87 Difference]: Start difference. First operand 114693 states and 136195 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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:55:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:02,009 INFO L93 Difference]: Finished difference Result 258057 states and 304133 transitions. [2025-03-08 00:55:02,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-08 00:55:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:02,146 INFO L225 Difference]: With dead ends: 258057 [2025-03-08 00:55:02,146 INFO L226 Difference]: Without dead ends: 145415 [2025-03-08 00:55:02,183 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:55:02,184 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 52 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 196 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:55:02,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 196 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145415 states. [2025-03-08 00:55:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145415 to 145413. [2025-03-08 00:55:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145413 states, 145412 states have (on average 1.1549184386433031) internal successors, (167939), 145412 states have internal predecessors, (167939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)