./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_9.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:40:19,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:40:19,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:40:19,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:40:19,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:40:19,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:40:19,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:40:19,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:40:19,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:40:19,681 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:40:19,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:40:19,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:40:19,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:40:19,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:40:19,683 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:40:19,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:40:19,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:40:19,683 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:40:19,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:40:19,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:40:19,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:40:19,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:40:19,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:40:19,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:40:19,684 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:40:19,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:40:19,684 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:40:19,684 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:40:19,684 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:40:19,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:40:19,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:40:19,685 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-jdk21/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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2025-02-05 10:40:19,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:40:19,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:40:19,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:40:19,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:40:19,942 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:40:19,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2025-02-05 10:40:21,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37dc470c8/959f46b496f140328c17bb54869cb9be/FLAG5efeadc40 [2025-02-05 10:40:21,316 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:40:21,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2025-02-05 10:40:21,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37dc470c8/959f46b496f140328c17bb54869cb9be/FLAG5efeadc40 [2025-02-05 10:40:21,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37dc470c8/959f46b496f140328c17bb54869cb9be [2025-02-05 10:40:21,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:40:21,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:40:21,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:40:21,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:40:21,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:40:21,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd3c4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21, skipping insertion in model container [2025-02-05 10:40:21,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:40:21,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2025-02-05 10:40:21,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:40:21,518 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:40:21,535 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2025-02-05 10:40:21,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:40:21,551 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:40:21,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21 WrapperNode [2025-02-05 10:40:21,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:40:21,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:40:21,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:40:21,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:40:21,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,588 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 133 [2025-02-05 10:40:21,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:40:21,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:40:21,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:40:21,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:40:21,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,609 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-02-05 10:40:21,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:40:21,625 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:40:21,625 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:40:21,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:40:21,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (1/1) ... [2025-02-05 10:40:21,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:40:21,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:21,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:40:21,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:40:21,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:40:21,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:40:21,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:40:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:40:21,710 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:40:21,711 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:40:21,836 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-05 10:40:21,836 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:40:21,841 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:40:21,841 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:40:21,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:21 BoogieIcfgContainer [2025-02-05 10:40:21,842 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:40:21,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:40:21,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:40:21,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:40:21,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:40:21" (1/3) ... [2025-02-05 10:40:21,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2486aa89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:21, skipping insertion in model container [2025-02-05 10:40:21,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:21" (2/3) ... [2025-02-05 10:40:21,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2486aa89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:21, skipping insertion in model container [2025-02-05 10:40:21,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:21" (3/3) ... [2025-02-05 10:40:21,848 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2025-02-05 10:40:21,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:40:21,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_9.c that has 1 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:40:21,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:40:21,890 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;@5633423a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:40:21,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:40:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 36 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 10:40:21,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:21,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:21,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:21,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1406280967, now seen corresponding path program 1 times [2025-02-05 10:40:21,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:21,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670439816] [2025-02-05 10:40:21,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:21,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 10:40:21,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:40:21,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:21,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670439816] [2025-02-05 10:40:22,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670439816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901885383] [2025-02-05 10:40:22,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,052 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 36 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,077 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2025-02-05 10:40:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-02-05 10:40:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,083 INFO L225 Difference]: With dead ends: 75 [2025-02-05 10:40:22,083 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 10:40:22,085 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-02-05 10:40:22,086 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 125 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-02-05 10:40:22,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 125 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 10:40:22,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2025-02-05 10:40:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2025-02-05 10:40:22,106 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2025-02-05 10:40:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,106 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2025-02-05 10:40:22,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2025-02-05 10:40:22,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 10:40:22,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:22,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:40:22,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1277198248, now seen corresponding path program 1 times [2025-02-05 10:40:22,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893877712] [2025-02-05 10:40:22,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 10:40:22,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:40:22,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893877712] [2025-02-05 10:40:22,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893877712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092153471] [2025-02-05 10:40:22,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,157 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,178 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2025-02-05 10:40:22,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-02-05 10:40:22,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,179 INFO L225 Difference]: With dead ends: 104 [2025-02-05 10:40:22,179 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 10:40:22,180 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-02-05 10:40:22,180 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 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-02-05 10:40:22,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 10:40:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-02-05 10:40:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 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-02-05 10:40:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2025-02-05 10:40:22,186 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2025-02-05 10:40:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,187 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2025-02-05 10:40:22,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2025-02-05 10:40:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:40:22,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:22,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:40:22,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash -645009393, now seen corresponding path program 1 times [2025-02-05 10:40:22,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30716848] [2025-02-05 10:40:22,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:40:22,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:40:22,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30716848] [2025-02-05 10:40:22,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30716848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977323500] [2025-02-05 10:40:22,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,258 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,272 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2025-02-05 10:40:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:40:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,273 INFO L225 Difference]: With dead ends: 96 [2025-02-05 10:40:22,273 INFO L226 Difference]: Without dead ends: 66 [2025-02-05 10:40:22,273 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-02-05 10:40:22,274 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:22,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-05 10:40:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-02-05 10:40:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2025-02-05 10:40:22,285 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2025-02-05 10:40:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,285 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2025-02-05 10:40:22,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2025-02-05 10:40:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:40:22,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:22,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:40:22,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash -938412400, now seen corresponding path program 1 times [2025-02-05 10:40:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888048478] [2025-02-05 10:40:22,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:40:22,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:40:22,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888048478] [2025-02-05 10:40:22,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888048478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055678356] [2025-02-05 10:40:22,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,335 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,347 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2025-02-05 10:40:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:40:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,348 INFO L225 Difference]: With dead ends: 121 [2025-02-05 10:40:22,349 INFO L226 Difference]: Without dead ends: 119 [2025-02-05 10:40:22,349 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-02-05 10:40:22,349 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:22,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-05 10:40:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2025-02-05 10:40:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2025-02-05 10:40:22,355 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2025-02-05 10:40:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,356 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2025-02-05 10:40:22,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2025-02-05 10:40:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:40:22,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:22,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:40:22,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash -809329681, now seen corresponding path program 1 times [2025-02-05 10:40:22,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298160356] [2025-02-05 10:40:22,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:40:22,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:40:22,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298160356] [2025-02-05 10:40:22,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298160356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623578452] [2025-02-05 10:40:22,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,385 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,414 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2025-02-05 10:40:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:40:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,415 INFO L225 Difference]: With dead ends: 201 [2025-02-05 10:40:22,415 INFO L226 Difference]: Without dead ends: 121 [2025-02-05 10:40:22,416 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-02-05 10:40:22,416 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 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-02-05 10:40:22,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-05 10:40:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-02-05 10:40:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2025-02-05 10:40:22,424 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2025-02-05 10:40:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,424 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2025-02-05 10:40:22,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2025-02-05 10:40:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 10:40:22,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:22,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:40:22,425 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash 974014079, now seen corresponding path program 1 times [2025-02-05 10:40:22,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728836278] [2025-02-05 10:40:22,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 10:40:22,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:40:22,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728836278] [2025-02-05 10:40:22,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728836278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526459201] [2025-02-05 10:40:22,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,452 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,464 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2025-02-05 10:40:22,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 10:40:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,469 INFO L225 Difference]: With dead ends: 180 [2025-02-05 10:40:22,469 INFO L226 Difference]: Without dead ends: 123 [2025-02-05 10:40:22,469 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-02-05 10:40:22,469 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:22,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-05 10:40:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2025-02-05 10:40:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2025-02-05 10:40:22,487 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2025-02-05 10:40:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,487 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2025-02-05 10:40:22,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2025-02-05 10:40:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 10:40:22,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:22,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:40:22,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash 680611072, now seen corresponding path program 1 times [2025-02-05 10:40:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562449334] [2025-02-05 10:40:22,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 10:40:22,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:40:22,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562449334] [2025-02-05 10:40:22,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562449334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728820742] [2025-02-05 10:40:22,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,525 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,551 INFO L93 Difference]: Finished difference Result 225 states and 389 transitions. [2025-02-05 10:40:22,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 10:40:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,554 INFO L225 Difference]: With dead ends: 225 [2025-02-05 10:40:22,554 INFO L226 Difference]: Without dead ends: 223 [2025-02-05 10:40:22,554 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-02-05 10:40:22,555 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:22,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-05 10:40:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 165. [2025-02-05 10:40:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.701219512195122) internal successors, (279), 164 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 279 transitions. [2025-02-05 10:40:22,574 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 279 transitions. Word has length 18 [2025-02-05 10:40:22,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,574 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 279 transitions. [2025-02-05 10:40:22,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 279 transitions. [2025-02-05 10:40:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 10:40:22,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:22,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:40:22,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,575 INFO L85 PathProgramCache]: Analyzing trace with hash 809693791, now seen corresponding path program 1 times [2025-02-05 10:40:22,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667253810] [2025-02-05 10:40:22,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 10:40:22,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:40:22,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667253810] [2025-02-05 10:40:22,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667253810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734460766] [2025-02-05 10:40:22,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,625 INFO L87 Difference]: Start difference. First operand 165 states and 279 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,644 INFO L93 Difference]: Finished difference Result 389 states and 661 transitions. [2025-02-05 10:40:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 10:40:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,645 INFO L225 Difference]: With dead ends: 389 [2025-02-05 10:40:22,646 INFO L226 Difference]: Without dead ends: 231 [2025-02-05 10:40:22,647 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-02-05 10:40:22,648 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 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-02-05 10:40:22,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-05 10:40:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2025-02-05 10:40:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2025-02-05 10:40:22,662 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2025-02-05 10:40:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,662 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2025-02-05 10:40:22,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2025-02-05 10:40:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:40:22,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:22,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:40:22,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash -375866058, now seen corresponding path program 1 times [2025-02-05 10:40:22,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20661828] [2025-02-05 10:40:22,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:40:22,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:40:22,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20661828] [2025-02-05 10:40:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20661828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676853367] [2025-02-05 10:40:22,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,707 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,731 INFO L93 Difference]: Finished difference Result 345 states and 573 transitions. [2025-02-05 10:40:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 10:40:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,732 INFO L225 Difference]: With dead ends: 345 [2025-02-05 10:40:22,732 INFO L226 Difference]: Without dead ends: 235 [2025-02-05 10:40:22,733 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-02-05 10:40:22,737 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:22,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-05 10:40:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2025-02-05 10:40:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 232 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 383 transitions. [2025-02-05 10:40:22,750 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 383 transitions. Word has length 19 [2025-02-05 10:40:22,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,752 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 383 transitions. [2025-02-05 10:40:22,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,752 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 383 transitions. [2025-02-05 10:40:22,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:40:22,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:22,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:40:22,753 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash -669269065, now seen corresponding path program 1 times [2025-02-05 10:40:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247286259] [2025-02-05 10:40:22,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:40:22,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:40:22,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247286259] [2025-02-05 10:40:22,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247286259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575381623] [2025-02-05 10:40:22,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,789 INFO L87 Difference]: Start difference. First operand 233 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,809 INFO L93 Difference]: Finished difference Result 669 states and 1097 transitions. [2025-02-05 10:40:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 10:40:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,812 INFO L225 Difference]: With dead ends: 669 [2025-02-05 10:40:22,815 INFO L226 Difference]: Without dead ends: 447 [2025-02-05 10:40:22,815 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-02-05 10:40:22,816 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 115 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-02-05 10:40:22,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-02-05 10:40:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2025-02-05 10:40:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.6103603603603605) internal successors, (715), 444 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 715 transitions. [2025-02-05 10:40:22,832 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 715 transitions. Word has length 19 [2025-02-05 10:40:22,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,832 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 715 transitions. [2025-02-05 10:40:22,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 715 transitions. [2025-02-05 10:40:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:40:22,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:22,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:40:22,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,835 INFO L85 PathProgramCache]: Analyzing trace with hash -798351784, now seen corresponding path program 1 times [2025-02-05 10:40:22,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214294139] [2025-02-05 10:40:22,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:40:22,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:40:22,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214294139] [2025-02-05 10:40:22,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214294139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589643665] [2025-02-05 10:40:22,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,866 INFO L87 Difference]: Start difference. First operand 445 states and 715 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,884 INFO L93 Difference]: Finished difference Result 545 states and 893 transitions. [2025-02-05 10:40:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 10:40:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,887 INFO L225 Difference]: With dead ends: 545 [2025-02-05 10:40:22,887 INFO L226 Difference]: Without dead ends: 543 [2025-02-05 10:40:22,890 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-02-05 10:40:22,891 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 34 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 147 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-02-05 10:40:22,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 147 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-02-05 10:40:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 445. [2025-02-05 10:40:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.5923423423423424) internal successors, (707), 444 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 707 transitions. [2025-02-05 10:40:22,905 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 707 transitions. Word has length 19 [2025-02-05 10:40:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,906 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 707 transitions. [2025-02-05 10:40:22,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 707 transitions. [2025-02-05 10:40:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:40:22,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:22,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:40:22,906 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,907 INFO L85 PathProgramCache]: Analyzing trace with hash 727522438, now seen corresponding path program 1 times [2025-02-05 10:40:22,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724811054] [2025-02-05 10:40:22,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 10:40:22,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:40:22,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:22,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:22,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724811054] [2025-02-05 10:40:22,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724811054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:22,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:22,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:22,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832586235] [2025-02-05 10:40:22,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:22,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:22,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:22,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:22,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:22,930 INFO L87 Difference]: Start difference. First operand 445 states and 707 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-02-05 10:40:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:22,968 INFO L93 Difference]: Finished difference Result 801 states and 1293 transitions. [2025-02-05 10:40:22,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:22,968 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-02-05 10:40:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:22,971 INFO L225 Difference]: With dead ends: 801 [2025-02-05 10:40:22,972 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 10:40:22,972 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-02-05 10:40:22,972 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 107 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-02-05 10:40:22,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 10:40:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 637. [2025-02-05 10:40:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 1.5518867924528301) internal successors, (987), 636 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 987 transitions. [2025-02-05 10:40:22,986 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 987 transitions. Word has length 20 [2025-02-05 10:40:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:22,986 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 987 transitions. [2025-02-05 10:40:22,986 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-02-05 10:40:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 987 transitions. [2025-02-05 10:40:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:40:22,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:22,987 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-02-05 10:40:22,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:40:22,987 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:22,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:22,988 INFO L85 PathProgramCache]: Analyzing trace with hash 856605157, now seen corresponding path program 1 times [2025-02-05 10:40:22,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:22,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757576518] [2025-02-05 10:40:22,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:22,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 10:40:22,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:40:22,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:22,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:23,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-02-05 10:40:23,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:23,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757576518] [2025-02-05 10:40:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757576518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:23,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815330508] [2025-02-05 10:40:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:23,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:23,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:23,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:23,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:23,005 INFO L87 Difference]: Start difference. First operand 637 states and 987 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-02-05 10:40:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:23,025 INFO L93 Difference]: Finished difference Result 1489 states and 2317 transitions. [2025-02-05 10:40:23,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:23,025 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-02-05 10:40:23,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:23,027 INFO L225 Difference]: With dead ends: 1489 [2025-02-05 10:40:23,027 INFO L226 Difference]: Without dead ends: 863 [2025-02-05 10:40:23,028 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-02-05 10:40:23,028 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 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-02-05 10:40:23,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-02-05 10:40:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 861. [2025-02-05 10:40:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.5290697674418605) internal successors, (1315), 860 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1315 transitions. [2025-02-05 10:40:23,047 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1315 transitions. Word has length 20 [2025-02-05 10:40:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:23,047 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1315 transitions. [2025-02-05 10:40:23,047 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-02-05 10:40:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1315 transitions. [2025-02-05 10:40:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:40:23,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:23,048 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-02-05 10:40:23,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:40:23,048 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:23,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1078385854, now seen corresponding path program 1 times [2025-02-05 10:40:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:23,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926518829] [2025-02-05 10:40:23,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:23,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:40:23,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:40:23,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:23,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:23,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:23,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926518829] [2025-02-05 10:40:23,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926518829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:23,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:23,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:23,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414052309] [2025-02-05 10:40:23,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:23,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:23,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:23,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:23,063 INFO L87 Difference]: Start difference. First operand 861 states and 1315 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-02-05 10:40:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:23,083 INFO L93 Difference]: Finished difference Result 1305 states and 1989 transitions. [2025-02-05 10:40:23,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:23,083 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-02-05 10:40:23,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:23,086 INFO L225 Difference]: With dead ends: 1305 [2025-02-05 10:40:23,086 INFO L226 Difference]: Without dead ends: 887 [2025-02-05 10:40:23,086 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-02-05 10:40:23,087 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:23,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-02-05 10:40:23,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2025-02-05 10:40:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2025-02-05 10:40:23,108 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2025-02-05 10:40:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:23,108 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2025-02-05 10:40:23,108 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-02-05 10:40:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2025-02-05 10:40:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:40:23,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:23,112 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-02-05 10:40:23,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 10:40:23,112 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash 784982847, now seen corresponding path program 1 times [2025-02-05 10:40:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:23,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971341724] [2025-02-05 10:40:23,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:23,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:23,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:40:23,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:40:23,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:23,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:23,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:23,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971341724] [2025-02-05 10:40:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971341724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:23,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:23,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:23,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961631166] [2025-02-05 10:40:23,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:23,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:23,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:23,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:23,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:23,137 INFO L87 Difference]: Start difference. First operand 885 states and 1331 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-02-05 10:40:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:23,175 INFO L93 Difference]: Finished difference Result 1545 states and 2357 transitions. [2025-02-05 10:40:23,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:23,175 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-02-05 10:40:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:23,179 INFO L225 Difference]: With dead ends: 1545 [2025-02-05 10:40:23,179 INFO L226 Difference]: Without dead ends: 1543 [2025-02-05 10:40:23,180 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-02-05 10:40:23,181 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 105 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-02-05 10:40:23,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:23,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2025-02-05 10:40:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2025-02-05 10:40:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2025-02-05 10:40:23,209 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2025-02-05 10:40:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:23,209 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2025-02-05 10:40:23,209 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-02-05 10:40:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2025-02-05 10:40:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:40:23,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:23,210 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-02-05 10:40:23,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 10:40:23,211 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:23,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:23,211 INFO L85 PathProgramCache]: Analyzing trace with hash 914065566, now seen corresponding path program 1 times [2025-02-05 10:40:23,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:23,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153825584] [2025-02-05 10:40:23,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:23,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:23,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:40:23,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:40:23,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:23,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:23,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:23,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153825584] [2025-02-05 10:40:23,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153825584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:23,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:23,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:23,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806969324] [2025-02-05 10:40:23,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:23,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:23,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:23,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:23,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:23,233 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 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-02-05 10:40:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:23,267 INFO L93 Difference]: Finished difference Result 2953 states and 4309 transitions. [2025-02-05 10:40:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:23,267 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-02-05 10:40:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:23,272 INFO L225 Difference]: With dead ends: 2953 [2025-02-05 10:40:23,272 INFO L226 Difference]: Without dead ends: 1703 [2025-02-05 10:40:23,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:23,274 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 134 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-02-05 10:40:23,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2025-02-05 10:40:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2025-02-05 10:40:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2025-02-05 10:40:23,312 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2025-02-05 10:40:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:23,312 INFO L471 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2025-02-05 10:40:23,312 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-02-05 10:40:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2025-02-05 10:40:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:40:23,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:23,314 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-02-05 10:40:23,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 10:40:23,314 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:23,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:23,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1435308980, now seen corresponding path program 1 times [2025-02-05 10:40:23,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:23,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360179798] [2025-02-05 10:40:23,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:23,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:23,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:40:23,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:40:23,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:23,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360179798] [2025-02-05 10:40:23,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360179798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:23,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:23,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:23,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762426533] [2025-02-05 10:40:23,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:23,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:23,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:23,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:23,337 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 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-02-05 10:40:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:23,377 INFO L93 Difference]: Finished difference Result 2553 states and 3637 transitions. [2025-02-05 10:40:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:23,378 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-02-05 10:40:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:23,382 INFO L225 Difference]: With dead ends: 2553 [2025-02-05 10:40:23,382 INFO L226 Difference]: Without dead ends: 1735 [2025-02-05 10:40:23,384 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-02-05 10:40:23,384 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 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-02-05 10:40:23,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2025-02-05 10:40:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2025-02-05 10:40:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2025-02-05 10:40:23,441 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2025-02-05 10:40:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:23,441 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2025-02-05 10:40:23,441 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-02-05 10:40:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2025-02-05 10:40:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:40:23,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:23,443 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-02-05 10:40:23,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 10:40:23,443 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:23,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1728711987, now seen corresponding path program 1 times [2025-02-05 10:40:23,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:23,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455587464] [2025-02-05 10:40:23,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:23,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:40:23,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:40:23,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:23,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:23,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:23,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455587464] [2025-02-05 10:40:23,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455587464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:23,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:23,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:23,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478319431] [2025-02-05 10:40:23,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:23,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:23,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:23,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:23,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:23,465 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 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-02-05 10:40:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:23,524 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2025-02-05 10:40:23,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:23,525 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-02-05 10:40:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:23,532 INFO L225 Difference]: With dead ends: 2953 [2025-02-05 10:40:23,532 INFO L226 Difference]: Without dead ends: 2951 [2025-02-05 10:40:23,533 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-02-05 10:40:23,533 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 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-02-05 10:40:23,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2025-02-05 10:40:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2025-02-05 10:40:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2025-02-05 10:40:23,603 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2025-02-05 10:40:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:23,603 INFO L471 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2025-02-05 10:40:23,603 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-02-05 10:40:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2025-02-05 10:40:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:40:23,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:23,607 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-02-05 10:40:23,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 10:40:23,607 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:23,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:23,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1599629268, now seen corresponding path program 1 times [2025-02-05 10:40:23,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:23,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138782501] [2025-02-05 10:40:23,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:23,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:23,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:40:23,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:40:23,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:23,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:23,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138782501] [2025-02-05 10:40:23,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138782501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:23,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:23,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:23,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415877651] [2025-02-05 10:40:23,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:23,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:23,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:23,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:23,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:23,627 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 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-02-05 10:40:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:23,691 INFO L93 Difference]: Finished difference Result 5833 states and 7909 transitions. [2025-02-05 10:40:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:23,692 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-02-05 10:40:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:23,699 INFO L225 Difference]: With dead ends: 5833 [2025-02-05 10:40:23,699 INFO L226 Difference]: Without dead ends: 3335 [2025-02-05 10:40:23,701 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-02-05 10:40:23,701 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 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-02-05 10:40:23,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2025-02-05 10:40:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2025-02-05 10:40:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2025-02-05 10:40:23,808 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2025-02-05 10:40:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:23,808 INFO L471 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2025-02-05 10:40:23,808 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-02-05 10:40:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2025-02-05 10:40:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:40:23,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:23,811 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-02-05 10:40:23,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 10:40:23,811 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:23,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2050437723, now seen corresponding path program 1 times [2025-02-05 10:40:23,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:23,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616200330] [2025-02-05 10:40:23,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:23,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:40:23,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:40:23,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:23,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:23,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:23,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616200330] [2025-02-05 10:40:23,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616200330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:23,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:23,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:23,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19033392] [2025-02-05 10:40:23,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:23,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:23,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:23,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:23,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:23,825 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 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-02-05 10:40:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:23,865 INFO L93 Difference]: Finished difference Result 5001 states and 6597 transitions. [2025-02-05 10:40:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:23,865 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-02-05 10:40:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:23,872 INFO L225 Difference]: With dead ends: 5001 [2025-02-05 10:40:23,872 INFO L226 Difference]: Without dead ends: 3399 [2025-02-05 10:40:23,873 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-02-05 10:40:23,874 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 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-02-05 10:40:23,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2025-02-05 10:40:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2025-02-05 10:40:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2025-02-05 10:40:23,935 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2025-02-05 10:40:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:23,935 INFO L471 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2025-02-05 10:40:23,935 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-02-05 10:40:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2025-02-05 10:40:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:40:23,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:23,937 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-02-05 10:40:23,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 10:40:23,938 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:23,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1951126566, now seen corresponding path program 1 times [2025-02-05 10:40:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:23,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305872183] [2025-02-05 10:40:23,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:23,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:23,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:40:23,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:40:23,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:23,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:23,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:23,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305872183] [2025-02-05 10:40:23,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305872183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:23,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:23,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:23,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835924536] [2025-02-05 10:40:23,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:23,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:23,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:23,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:23,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:23,952 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 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-02-05 10:40:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:24,034 INFO L93 Difference]: Finished difference Result 5641 states and 7365 transitions. [2025-02-05 10:40:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:24,035 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-02-05 10:40:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:24,047 INFO L225 Difference]: With dead ends: 5641 [2025-02-05 10:40:24,047 INFO L226 Difference]: Without dead ends: 5639 [2025-02-05 10:40:24,047 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-02-05 10:40:24,048 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 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-02-05 10:40:24,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2025-02-05 10:40:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2025-02-05 10:40:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2025-02-05 10:40:24,139 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2025-02-05 10:40:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:24,139 INFO L471 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2025-02-05 10:40:24,139 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-02-05 10:40:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2025-02-05 10:40:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:40:24,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:24,143 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-02-05 10:40:24,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 10:40:24,144 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:24,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2080209285, now seen corresponding path program 1 times [2025-02-05 10:40:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:24,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054566889] [2025-02-05 10:40:24,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:24,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:24,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:40:24,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:40:24,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:24,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:24,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:24,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054566889] [2025-02-05 10:40:24,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054566889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:24,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:24,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:24,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561395874] [2025-02-05 10:40:24,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:24,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:24,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:24,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:24,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:24,161 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 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-02-05 10:40:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:24,249 INFO L93 Difference]: Finished difference Result 11529 states and 14405 transitions. [2025-02-05 10:40:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:24,249 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-02-05 10:40:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:24,269 INFO L225 Difference]: With dead ends: 11529 [2025-02-05 10:40:24,269 INFO L226 Difference]: Without dead ends: 6535 [2025-02-05 10:40:24,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:24,276 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 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-02-05 10:40:24,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2025-02-05 10:40:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2025-02-05 10:40:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2025-02-05 10:40:24,423 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2025-02-05 10:40:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:24,423 INFO L471 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2025-02-05 10:40:24,423 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-02-05 10:40:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2025-02-05 10:40:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:40:24,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:24,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] [2025-02-05 10:40:24,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 10:40:24,428 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:24,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash 355407507, now seen corresponding path program 1 times [2025-02-05 10:40:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:24,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730938733] [2025-02-05 10:40:24,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:24,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:24,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:40:24,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:40:24,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:24,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:24,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:24,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730938733] [2025-02-05 10:40:24,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730938733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:24,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426648658] [2025-02-05 10:40:24,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:24,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:24,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:24,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:24,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:24,445 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 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-02-05 10:40:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:24,544 INFO L93 Difference]: Finished difference Result 9801 states and 11845 transitions. [2025-02-05 10:40:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:24,545 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-02-05 10:40:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:24,556 INFO L225 Difference]: With dead ends: 9801 [2025-02-05 10:40:24,556 INFO L226 Difference]: Without dead ends: 6663 [2025-02-05 10:40:24,559 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-02-05 10:40:24,559 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 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-02-05 10:40:24,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:24,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2025-02-05 10:40:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2025-02-05 10:40:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2025-02-05 10:40:24,741 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2025-02-05 10:40:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:24,741 INFO L471 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2025-02-05 10:40:24,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-02-05 10:40:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2025-02-05 10:40:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:40:24,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:24,751 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-02-05 10:40:24,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 10:40:24,752 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:24,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash 62004500, now seen corresponding path program 1 times [2025-02-05 10:40:24,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:24,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132416531] [2025-02-05 10:40:24,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:24,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:24,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:40:24,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:40:24,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:24,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:24,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132416531] [2025-02-05 10:40:24,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132416531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:24,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:24,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:24,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245050501] [2025-02-05 10:40:24,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:24,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:24,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:24,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:24,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:24,769 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 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-02-05 10:40:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:24,917 INFO L93 Difference]: Finished difference Result 10759 states and 12676 transitions. [2025-02-05 10:40:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:24,918 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-02-05 10:40:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:24,933 INFO L225 Difference]: With dead ends: 10759 [2025-02-05 10:40:24,933 INFO L226 Difference]: Without dead ends: 10757 [2025-02-05 10:40:24,936 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-02-05 10:40:24,936 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 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-02-05 10:40:24,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2025-02-05 10:40:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2025-02-05 10:40:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2025-02-05 10:40:25,115 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2025-02-05 10:40:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:25,115 INFO L471 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2025-02-05 10:40:25,115 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-02-05 10:40:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2025-02-05 10:40:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:40:25,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:25,124 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-02-05 10:40:25,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 10:40:25,124 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:25,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash 191087219, now seen corresponding path program 1 times [2025-02-05 10:40:25,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:25,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261291900] [2025-02-05 10:40:25,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:25,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:40:25,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:40:25,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:25,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:40:25,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261291900] [2025-02-05 10:40:25,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261291900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:25,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:25,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:25,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217023613] [2025-02-05 10:40:25,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:25,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:25,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:25,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:25,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:25,138 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 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-02-05 10:40:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:25,255 INFO L93 Difference]: Finished difference Result 22789 states and 25987 transitions. [2025-02-05 10:40:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:25,255 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-02-05 10:40:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:25,256 INFO L225 Difference]: With dead ends: 22789 [2025-02-05 10:40:25,256 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:40:25,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-02-05 10:40:25,271 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 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-02-05 10:40:25,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:25,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:40:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:40:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:40:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:40:25,272 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2025-02-05 10:40:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:25,272 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:40:25,272 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-02-05 10:40:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:40:25,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:40:25,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:40:25,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 10:40:25,277 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:25,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:40:25,286 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:40:25,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:40:25 BoogieIcfgContainer [2025-02-05 10:40:25,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:40:25,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:40:25,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:40:25,293 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:40:25,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:21" (3/4) ... [2025-02-05 10:40:25,295 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:40:25,301 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-05 10:40:25,301 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:40:25,301 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:40:25,302 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:40:25,353 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:40:25,354 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:40:25,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:40:25,354 INFO L158 Benchmark]: Toolchain (without parser) took 4009.61ms. Allocated memory was 536.9MB in the beginning and 520.1MB in the end (delta: -16.8MB). Free memory was 500.9MB in the beginning and 211.2MB in the end (delta: 289.7MB). Peak memory consumption was 271.5MB. Max. memory is 16.1GB. [2025-02-05 10:40:25,354 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:40:25,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.68ms. Allocated memory was 536.9MB in the beginning and 142.6MB in the end (delta: -394.3MB). Free memory was 500.9MB in the beginning and 94.8MB in the end (delta: 406.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:40:25,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.76ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:40:25,355 INFO L158 Benchmark]: Boogie Preprocessor took 35.05ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 92.7MB in the end (delta: 693.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:40:25,355 INFO L158 Benchmark]: IcfgBuilder took 217.45ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 78.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 10:40:25,355 INFO L158 Benchmark]: TraceAbstraction took 3448.88ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 77.4MB in the beginning and 215.5MB in the end (delta: -138.1MB). Peak memory consumption was 237.9MB. Max. memory is 16.1GB. [2025-02-05 10:40:25,356 INFO L158 Benchmark]: Witness Printer took 61.02ms. Allocated memory is still 520.1MB. Free memory was 215.5MB in the beginning and 211.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:40:25,356 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.68ms. Allocated memory was 536.9MB in the beginning and 142.6MB in the end (delta: -394.3MB). Free memory was 500.9MB in the beginning and 94.8MB in the end (delta: 406.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.76ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.05ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 92.7MB in the end (delta: 693.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 217.45ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 78.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3448.88ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 77.4MB in the beginning and 215.5MB in the end (delta: -138.1MB). Peak memory consumption was 237.9MB. Max. memory is 16.1GB. * Witness Printer took 61.02ms. Allocated memory is still 520.1MB. Free memory was 215.5MB in the beginning and 211.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 921 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 921 mSDsluCounter, 3096 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1232 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1864 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=24, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 1010 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-05 10:40:25,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE