./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_8.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:05:02,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:05:02,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:05:02,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:05:02,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:05:02,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:05:02,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:05:02,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:05:02,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:05:02,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:05:02,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:05:02,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:05:02,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:05:02,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:05:02,486 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:05:02,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:05:02,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:05:02,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:05:02,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:05:02,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:05:02,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:05:02,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:05:02,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:05:02,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:05:02,487 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:05:02,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:05:02,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:05:02,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:05:02,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:05:02,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:05:02,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:05:02,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:05:02,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:05:02,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:05:02,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:05:02,488 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:05:02,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:05:02,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:05:02,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:05:02,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:05:02,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:05:02,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:05:02,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:05:02,488 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2025-03-16 14:05:02,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:05:02,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:05:02,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:05:02,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:05:02,694 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:05:02,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2025-03-16 14:05:03,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1d822ca/c8a0f3f3a25b43aba8871ec351b0389e/FLAGa4826062a [2025-03-16 14:05:04,037 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:05:04,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2025-03-16 14:05:04,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1d822ca/c8a0f3f3a25b43aba8871ec351b0389e/FLAGa4826062a [2025-03-16 14:05:04,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1d822ca/c8a0f3f3a25b43aba8871ec351b0389e [2025-03-16 14:05:04,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:05:04,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:05:04,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:05:04,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:05:04,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:05:04,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c86681a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04, skipping insertion in model container [2025-03-16 14:05:04,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:05:04,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2025-03-16 14:05:04,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:05:04,519 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:05:04,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2025-03-16 14:05:04,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:05:04,549 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:05:04,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04 WrapperNode [2025-03-16 14:05:04,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:05:04,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:05:04,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:05:04,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:05:04,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,578 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2025-03-16 14:05:04,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:05:04,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:05:04,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:05:04,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:05:04,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,602 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:05:04,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:05:04,610 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:05:04,610 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:05:04,610 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:05:04,615 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (1/1) ... [2025-03-16 14:05:04,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:05:04,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:05:04,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:05:04,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:05:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:05:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:05:04,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:05:04,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:05:04,712 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:05:04,713 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:05:04,860 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-16 14:05:04,861 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:05:04,867 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:05:04,868 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:05:04,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:05:04 BoogieIcfgContainer [2025-03-16 14:05:04,868 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:05:04,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:05:04,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:05:04,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:05:04,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:05:04" (1/3) ... [2025-03-16 14:05:04,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7141cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:05:04, skipping insertion in model container [2025-03-16 14:05:04,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:05:04" (2/3) ... [2025-03-16 14:05:04,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7141cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:05:04, skipping insertion in model container [2025-03-16 14:05:04,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:05:04" (3/3) ... [2025-03-16 14:05:04,877 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2025-03-16 14:05:04,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:05:04,890 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_8.c that has 1 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:05:04,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:05:04,944 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;@72b58a9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:05:04,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:05:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 32 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:04,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 14:05:04,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:04,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:04,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:04,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1858257029, now seen corresponding path program 1 times [2025-03-16 14:05:04,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:04,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550957523] [2025-03-16 14:05:04,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:04,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 14:05:05,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 14:05:05,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550957523] [2025-03-16 14:05:05,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550957523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527282687] [2025-03-16 14:05:05,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,115 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 32 states have internal predecessors, (58), 0 states have call successors, (0), 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 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,144 INFO L93 Difference]: Finished difference Result 68 states and 117 transitions. [2025-03-16 14:05:05,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-16 14:05:05,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,151 INFO L225 Difference]: With dead ends: 68 [2025-03-16 14:05:05,151 INFO L226 Difference]: Without dead ends: 56 [2025-03-16 14:05:05,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,154 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 111 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-16 14:05:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2025-03-16 14:05:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2025-03-16 14:05:05,178 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 69 transitions. Word has length 14 [2025-03-16 14:05:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,178 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 69 transitions. [2025-03-16 14:05:05,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 69 transitions. [2025-03-16 14:05:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 14:05:05,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:05:05,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,179 INFO L85 PathProgramCache]: Analyzing trace with hash 639758908, now seen corresponding path program 1 times [2025-03-16 14:05:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748904888] [2025-03-16 14:05:05,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 14:05:05,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 14:05:05,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748904888] [2025-03-16 14:05:05,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748904888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953814106] [2025-03-16 14:05:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,231 INFO L87 Difference]: Start difference. First operand 38 states and 69 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,246 INFO L93 Difference]: Finished difference Result 93 states and 168 transitions. [2025-03-16 14:05:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-16 14:05:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,247 INFO L225 Difference]: With dead ends: 93 [2025-03-16 14:05:05,247 INFO L226 Difference]: Without dead ends: 56 [2025-03-16 14:05:05,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,248 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 38 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 113 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-16 14:05:05,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-16 14:05:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.830188679245283) internal successors, (97), 53 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2025-03-16 14:05:05,252 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 14 [2025-03-16 14:05:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,252 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2025-03-16 14:05:05,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2025-03-16 14:05:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 14:05:05,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:05:05,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1771365644, now seen corresponding path program 1 times [2025-03-16 14:05:05,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602895282] [2025-03-16 14:05:05,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 14:05:05,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 14:05:05,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602895282] [2025-03-16 14:05:05,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602895282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076335935] [2025-03-16 14:05:05,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,309 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,327 INFO L93 Difference]: Finished difference Result 86 states and 149 transitions. [2025-03-16 14:05:05,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-16 14:05:05,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,329 INFO L225 Difference]: With dead ends: 86 [2025-03-16 14:05:05,329 INFO L226 Difference]: Without dead ends: 59 [2025-03-16 14:05:05,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,329 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 126 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-16 14:05:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-03-16 14:05:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 56 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2025-03-16 14:05:05,338 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 15 [2025-03-16 14:05:05,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,338 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2025-03-16 14:05:05,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2025-03-16 14:05:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 14:05:05,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:05:05,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1642282925, now seen corresponding path program 1 times [2025-03-16 14:05:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664435074] [2025-03-16 14:05:05,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 14:05:05,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 14:05:05,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664435074] [2025-03-16 14:05:05,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664435074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176530038] [2025-03-16 14:05:05,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,378 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,397 INFO L93 Difference]: Finished difference Result 108 states and 188 transitions. [2025-03-16 14:05:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-16 14:05:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,398 INFO L225 Difference]: With dead ends: 108 [2025-03-16 14:05:05,398 INFO L226 Difference]: Without dead ends: 106 [2025-03-16 14:05:05,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,399 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-16 14:05:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2025-03-16 14:05:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.76) internal successors, (132), 75 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 132 transitions. [2025-03-16 14:05:05,405 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 132 transitions. Word has length 15 [2025-03-16 14:05:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,405 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 132 transitions. [2025-03-16 14:05:05,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2025-03-16 14:05:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 14:05:05,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:05:05,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash 855733012, now seen corresponding path program 1 times [2025-03-16 14:05:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144547903] [2025-03-16 14:05:05,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 14:05:05,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 14:05:05,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144547903] [2025-03-16 14:05:05,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144547903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944220959] [2025-03-16 14:05:05,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,441 INFO L87 Difference]: Start difference. First operand 76 states and 132 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,464 INFO L93 Difference]: Finished difference Result 180 states and 314 transitions. [2025-03-16 14:05:05,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-16 14:05:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,466 INFO L225 Difference]: With dead ends: 180 [2025-03-16 14:05:05,466 INFO L226 Difference]: Without dead ends: 108 [2025-03-16 14:05:05,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,468 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 37 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 114 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-16 14:05:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2025-03-16 14:05:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.7333333333333334) internal successors, (182), 105 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 182 transitions. [2025-03-16 14:05:05,481 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 182 transitions. Word has length 15 [2025-03-16 14:05:05,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,481 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 182 transitions. [2025-03-16 14:05:05,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 182 transitions. [2025-03-16 14:05:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 14:05:05,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:05:05,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash 628864067, now seen corresponding path program 1 times [2025-03-16 14:05:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744053345] [2025-03-16 14:05:05,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 14:05:05,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 14:05:05,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744053345] [2025-03-16 14:05:05,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744053345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097269111] [2025-03-16 14:05:05,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,529 INFO L87 Difference]: Start difference. First operand 106 states and 182 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-03-16 14:05:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,546 INFO L93 Difference]: Finished difference Result 161 states and 273 transitions. [2025-03-16 14:05:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,546 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-03-16 14:05:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,547 INFO L225 Difference]: With dead ends: 161 [2025-03-16 14:05:05,547 INFO L226 Difference]: Without dead ends: 110 [2025-03-16 14:05:05,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,548 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 39 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 122 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-16 14:05:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2025-03-16 14:05:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.7009345794392523) internal successors, (182), 107 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 182 transitions. [2025-03-16 14:05:05,559 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 182 transitions. Word has length 16 [2025-03-16 14:05:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,559 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 182 transitions. [2025-03-16 14:05:05,559 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-03-16 14:05:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 182 transitions. [2025-03-16 14:05:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 14:05:05,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:05:05,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,562 INFO L85 PathProgramCache]: Analyzing trace with hash 757946786, now seen corresponding path program 1 times [2025-03-16 14:05:05,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344059688] [2025-03-16 14:05:05,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 14:05:05,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 14:05:05,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344059688] [2025-03-16 14:05:05,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344059688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092780322] [2025-03-16 14:05:05,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,592 INFO L87 Difference]: Start difference. First operand 108 states and 182 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-03-16 14:05:05,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,607 INFO L93 Difference]: Finished difference Result 200 states and 340 transitions. [2025-03-16 14:05:05,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,608 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-03-16 14:05:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,609 INFO L225 Difference]: With dead ends: 200 [2025-03-16 14:05:05,609 INFO L226 Difference]: Without dead ends: 198 [2025-03-16 14:05:05,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,610 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 97 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-16 14:05:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 148. [2025-03-16 14:05:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.6734693877551021) internal successors, (246), 147 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 246 transitions. [2025-03-16 14:05:05,617 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 246 transitions. Word has length 16 [2025-03-16 14:05:05,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,617 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 246 transitions. [2025-03-16 14:05:05,617 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-03-16 14:05:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 246 transitions. [2025-03-16 14:05:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 14:05:05,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:05:05,618 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1039004573, now seen corresponding path program 1 times [2025-03-16 14:05:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104221103] [2025-03-16 14:05:05,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 14:05:05,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 14:05:05,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104221103] [2025-03-16 14:05:05,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104221103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664834342] [2025-03-16 14:05:05,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,639 INFO L87 Difference]: Start difference. First operand 148 states and 246 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-03-16 14:05:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,657 INFO L93 Difference]: Finished difference Result 348 states and 580 transitions. [2025-03-16 14:05:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,657 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-03-16 14:05:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,659 INFO L225 Difference]: With dead ends: 348 [2025-03-16 14:05:05,659 INFO L226 Difference]: Without dead ends: 206 [2025-03-16 14:05:05,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,660 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 36 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 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-03-16 14:05:05,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-16 14:05:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2025-03-16 14:05:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.645320197044335) internal successors, (334), 203 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 334 transitions. [2025-03-16 14:05:05,676 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 334 transitions. Word has length 16 [2025-03-16 14:05:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,676 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 334 transitions. [2025-03-16 14:05:05,676 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-03-16 14:05:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 334 transitions. [2025-03-16 14:05:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 14:05:05,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:05:05,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2021540859, now seen corresponding path program 1 times [2025-03-16 14:05:05,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623578452] [2025-03-16 14:05:05,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 14:05:05,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 14:05:05,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623578452] [2025-03-16 14:05:05,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623578452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986832973] [2025-03-16 14:05:05,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,707 INFO L87 Difference]: Start difference. First operand 204 states and 334 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,719 INFO L93 Difference]: Finished difference Result 308 states and 500 transitions. [2025-03-16 14:05:05,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-16 14:05:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,720 INFO L225 Difference]: With dead ends: 308 [2025-03-16 14:05:05,721 INFO L226 Difference]: Without dead ends: 210 [2025-03-16 14:05:05,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,723 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 38 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-16 14:05:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2025-03-16 14:05:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.6135265700483092) internal successors, (334), 207 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 334 transitions. [2025-03-16 14:05:05,734 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 334 transitions. Word has length 17 [2025-03-16 14:05:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,734 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 334 transitions. [2025-03-16 14:05:05,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 334 transitions. [2025-03-16 14:05:05,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 14:05:05,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:05:05,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2144343718, now seen corresponding path program 1 times [2025-03-16 14:05:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804957860] [2025-03-16 14:05:05,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 14:05:05,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 14:05:05,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804957860] [2025-03-16 14:05:05,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804957860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580198162] [2025-03-16 14:05:05,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,763 INFO L87 Difference]: Start difference. First operand 208 states and 334 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,778 INFO L93 Difference]: Finished difference Result 376 states and 612 transitions. [2025-03-16 14:05:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-16 14:05:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,780 INFO L225 Difference]: With dead ends: 376 [2025-03-16 14:05:05,780 INFO L226 Difference]: Without dead ends: 374 [2025-03-16 14:05:05,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,780 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-16 14:05:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 292. [2025-03-16 14:05:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.5738831615120275) internal successors, (458), 291 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 458 transitions. [2025-03-16 14:05:05,788 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 458 transitions. Word has length 17 [2025-03-16 14:05:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,789 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 458 transitions. [2025-03-16 14:05:05,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 458 transitions. [2025-03-16 14:05:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 14:05:05,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:05:05,790 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,790 INFO L85 PathProgramCache]: Analyzing trace with hash 353672219, now seen corresponding path program 1 times [2025-03-16 14:05:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728820742] [2025-03-16 14:05:05,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 14:05:05,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 14:05:05,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728820742] [2025-03-16 14:05:05,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728820742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452294153] [2025-03-16 14:05:05,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,818 INFO L87 Difference]: Start difference. First operand 292 states and 458 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,836 INFO L93 Difference]: Finished difference Result 680 states and 1068 transitions. [2025-03-16 14:05:05,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-16 14:05:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,838 INFO L225 Difference]: With dead ends: 680 [2025-03-16 14:05:05,838 INFO L226 Difference]: Without dead ends: 398 [2025-03-16 14:05:05,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,839 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 116 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-16 14:05:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2025-03-16 14:05:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.5443037974683544) internal successors, (610), 395 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 610 transitions. [2025-03-16 14:05:05,850 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 610 transitions. Word has length 17 [2025-03-16 14:05:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,850 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 610 transitions. [2025-03-16 14:05:05,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 610 transitions. [2025-03-16 14:05:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 14:05:05,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:05:05,851 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2050119062, now seen corresponding path program 1 times [2025-03-16 14:05:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284767714] [2025-03-16 14:05:05,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 14:05:05,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 14:05:05,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284767714] [2025-03-16 14:05:05,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284767714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125973094] [2025-03-16 14:05:05,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,870 INFO L87 Difference]: Start difference. First operand 396 states and 610 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,887 INFO L93 Difference]: Finished difference Result 596 states and 912 transitions. [2025-03-16 14:05:05,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-16 14:05:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,890 INFO L225 Difference]: With dead ends: 596 [2025-03-16 14:05:05,890 INFO L226 Difference]: Without dead ends: 406 [2025-03-16 14:05:05,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-03-16 14:05:05,890 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 114 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-16 14:05:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2025-03-16 14:05:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 1.5136476426799008) internal successors, (610), 403 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 610 transitions. [2025-03-16 14:05:05,902 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 610 transitions. Word has length 18 [2025-03-16 14:05:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,902 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 610 transitions. [2025-03-16 14:05:05,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 610 transitions. [2025-03-16 14:05:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 14:05:05,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:05:05,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1921036343, now seen corresponding path program 1 times [2025-03-16 14:05:05,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457092681] [2025-03-16 14:05:05,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 14:05:05,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 14:05:05,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457092681] [2025-03-16 14:05:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457092681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224692579] [2025-03-16 14:05:05,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,938 INFO L87 Difference]: Start difference. First operand 404 states and 610 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:05,955 INFO L93 Difference]: Finished difference Result 712 states and 1092 transitions. [2025-03-16 14:05:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:05,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-16 14:05:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:05,957 INFO L225 Difference]: With dead ends: 712 [2025-03-16 14:05:05,957 INFO L226 Difference]: Without dead ends: 710 [2025-03-16 14:05:05,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,958 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:05,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-03-16 14:05:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 580. [2025-03-16 14:05:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.468048359240069) internal successors, (850), 579 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 850 transitions. [2025-03-16 14:05:05,974 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 850 transitions. Word has length 18 [2025-03-16 14:05:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:05,975 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 850 transitions. [2025-03-16 14:05:05,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 850 transitions. [2025-03-16 14:05:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 14:05:05,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:05,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:05,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:05:05,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:05,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:05,977 INFO L85 PathProgramCache]: Analyzing trace with hash 576979594, now seen corresponding path program 1 times [2025-03-16 14:05:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:05,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680661100] [2025-03-16 14:05:05,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:05,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:05,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 14:05:05,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 14:05:05,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:05,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:05,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680661100] [2025-03-16 14:05:05,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680661100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:05,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:05,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:05,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800776286] [2025-03-16 14:05:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:05,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:05,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:05,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:05,995 INFO L87 Difference]: Start difference. First operand 580 states and 850 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:06,019 INFO L93 Difference]: Finished difference Result 1336 states and 1956 transitions. [2025-03-16 14:05:06,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:06,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-16 14:05:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:06,023 INFO L225 Difference]: With dead ends: 1336 [2025-03-16 14:05:06,023 INFO L226 Difference]: Without dead ends: 774 [2025-03-16 14:05:06,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,024 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 34 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:06,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 117 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:06,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-03-16 14:05:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 772. [2025-03-16 14:05:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 1.4345006485084306) internal successors, (1106), 771 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1106 transitions. [2025-03-16 14:05:06,045 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1106 transitions. Word has length 18 [2025-03-16 14:05:06,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:06,046 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1106 transitions. [2025-03-16 14:05:06,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1106 transitions. [2025-03-16 14:05:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 14:05:06,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:06,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:06,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:05:06,048 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:06,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash 577442050, now seen corresponding path program 1 times [2025-03-16 14:05:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:06,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830705286] [2025-03-16 14:05:06,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:06,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:06,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 14:05:06,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 14:05:06,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:06,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:06,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:06,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830705286] [2025-03-16 14:05:06,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830705286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:06,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:06,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:06,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814319476] [2025-03-16 14:05:06,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:06,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:06,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:06,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:06,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,067 INFO L87 Difference]: Start difference. First operand 772 states and 1106 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:06,086 INFO L93 Difference]: Finished difference Result 1160 states and 1652 transitions. [2025-03-16 14:05:06,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:06,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 14:05:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:06,088 INFO L225 Difference]: With dead ends: 1160 [2025-03-16 14:05:06,088 INFO L226 Difference]: Without dead ends: 790 [2025-03-16 14:05:06,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,089 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 36 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:06,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 110 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-16 14:05:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2025-03-16 14:05:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4053367217280812) internal successors, (1106), 787 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1106 transitions. [2025-03-16 14:05:06,109 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1106 transitions. Word has length 19 [2025-03-16 14:05:06,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:06,109 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1106 transitions. [2025-03-16 14:05:06,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,109 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1106 transitions. [2025-03-16 14:05:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 14:05:06,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:06,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:06,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:05:06,110 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:06,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:06,110 INFO L85 PathProgramCache]: Analyzing trace with hash 706524769, now seen corresponding path program 1 times [2025-03-16 14:05:06,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:06,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218766757] [2025-03-16 14:05:06,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:06,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:06,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 14:05:06,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 14:05:06,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:06,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:06,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:06,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218766757] [2025-03-16 14:05:06,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218766757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:06,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724811054] [2025-03-16 14:05:06,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:06,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:06,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:06,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:06,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,126 INFO L87 Difference]: Start difference. First operand 788 states and 1106 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:06,165 INFO L93 Difference]: Finished difference Result 1352 states and 1924 transitions. [2025-03-16 14:05:06,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:06,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 14:05:06,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:06,169 INFO L225 Difference]: With dead ends: 1352 [2025-03-16 14:05:06,169 INFO L226 Difference]: Without dead ends: 1350 [2025-03-16 14:05:06,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,170 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:06,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:06,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-03-16 14:05:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1156. [2025-03-16 14:05:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.3593073593073592) internal successors, (1570), 1155 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1570 transitions. [2025-03-16 14:05:06,196 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1570 transitions. Word has length 19 [2025-03-16 14:05:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:06,196 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1570 transitions. [2025-03-16 14:05:06,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1570 transitions. [2025-03-16 14:05:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 14:05:06,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:06,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:06,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:05:06,198 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:06,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:06,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1090426590, now seen corresponding path program 1 times [2025-03-16 14:05:06,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:06,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231500304] [2025-03-16 14:05:06,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:06,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:06,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 14:05:06,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 14:05:06,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:06,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:06,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:06,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231500304] [2025-03-16 14:05:06,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231500304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:06,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:06,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:06,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617199641] [2025-03-16 14:05:06,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:06,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:06,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:06,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:06,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,212 INFO L87 Difference]: Start difference. First operand 1156 states and 1570 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:06,245 INFO L93 Difference]: Finished difference Result 2632 states and 3556 transitions. [2025-03-16 14:05:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:06,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 14:05:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:06,250 INFO L225 Difference]: With dead ends: 2632 [2025-03-16 14:05:06,250 INFO L226 Difference]: Without dead ends: 1510 [2025-03-16 14:05:06,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,251 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:06,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2025-03-16 14:05:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1508. [2025-03-16 14:05:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1507 states have (on average 1.3178500331785004) internal successors, (1986), 1507 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1986 transitions. [2025-03-16 14:05:06,290 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1986 transitions. Word has length 19 [2025-03-16 14:05:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:06,290 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 1986 transitions. [2025-03-16 14:05:06,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1986 transitions. [2025-03-16 14:05:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 14:05:06,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:06,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:06,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:05:06,292 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:06,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash 427457681, now seen corresponding path program 1 times [2025-03-16 14:05:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:06,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588968814] [2025-03-16 14:05:06,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:06,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:06,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 14:05:06,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 14:05:06,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:06,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:06,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:06,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588968814] [2025-03-16 14:05:06,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588968814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:06,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:06,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120214707] [2025-03-16 14:05:06,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:06,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:06,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:06,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:06,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,307 INFO L87 Difference]: Start difference. First operand 1508 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:06,349 INFO L93 Difference]: Finished difference Result 2264 states and 2964 transitions. [2025-03-16 14:05:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:06,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-16 14:05:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:06,353 INFO L225 Difference]: With dead ends: 2264 [2025-03-16 14:05:06,353 INFO L226 Difference]: Without dead ends: 1542 [2025-03-16 14:05:06,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,355 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:06,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2025-03-16 14:05:06,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1540. [2025-03-16 14:05:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1539 states have (on average 1.290448343079922) internal successors, (1986), 1539 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 1986 transitions. [2025-03-16 14:05:06,396 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 1986 transitions. Word has length 20 [2025-03-16 14:05:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:06,396 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 1986 transitions. [2025-03-16 14:05:06,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1986 transitions. [2025-03-16 14:05:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 14:05:06,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:06,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:06,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:05:06,398 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:06,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:06,399 INFO L85 PathProgramCache]: Analyzing trace with hash 556540400, now seen corresponding path program 1 times [2025-03-16 14:05:06,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:06,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477472485] [2025-03-16 14:05:06,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:06,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:06,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 14:05:06,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 14:05:06,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:06,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477472485] [2025-03-16 14:05:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477472485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:06,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:06,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395005917] [2025-03-16 14:05:06,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:06,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:06,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:06,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,413 INFO L87 Difference]: Start difference. First operand 1540 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:06,461 INFO L93 Difference]: Finished difference Result 2568 states and 3332 transitions. [2025-03-16 14:05:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-16 14:05:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:06,469 INFO L225 Difference]: With dead ends: 2568 [2025-03-16 14:05:06,469 INFO L226 Difference]: Without dead ends: 2566 [2025-03-16 14:05:06,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,471 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:06,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2025-03-16 14:05:06,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2308. [2025-03-16 14:05:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2307 states have (on average 1.2492414390983961) internal successors, (2882), 2307 states have internal predecessors, (2882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2882 transitions. [2025-03-16 14:05:06,546 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2882 transitions. Word has length 20 [2025-03-16 14:05:06,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:06,546 INFO L471 AbstractCegarLoop]: Abstraction has 2308 states and 2882 transitions. [2025-03-16 14:05:06,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2882 transitions. [2025-03-16 14:05:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 14:05:06,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:06,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:06,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:05:06,550 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:06,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:06,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1240410959, now seen corresponding path program 1 times [2025-03-16 14:05:06,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:06,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556598432] [2025-03-16 14:05:06,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:06,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:06,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 14:05:06,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 14:05:06,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:06,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:06,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:06,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556598432] [2025-03-16 14:05:06,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556598432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:06,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:06,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319221887] [2025-03-16 14:05:06,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:06,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:06,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:06,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,568 INFO L87 Difference]: Start difference. First operand 2308 states and 2882 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:06,642 INFO L93 Difference]: Finished difference Result 5192 states and 6404 transitions. [2025-03-16 14:05:06,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:06,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-16 14:05:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:06,650 INFO L225 Difference]: With dead ends: 5192 [2025-03-16 14:05:06,651 INFO L226 Difference]: Without dead ends: 2950 [2025-03-16 14:05:06,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,653 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:06,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2025-03-16 14:05:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2948. [2025-03-16 14:05:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2947 states have (on average 1.1951136749236513) internal successors, (3522), 2947 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3522 transitions. [2025-03-16 14:05:06,747 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3522 transitions. Word has length 20 [2025-03-16 14:05:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:06,748 INFO L471 AbstractCegarLoop]: Abstraction has 2948 states and 3522 transitions. [2025-03-16 14:05:06,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3522 transitions. [2025-03-16 14:05:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 14:05:06,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:06,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] [2025-03-16 14:05:06,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 14:05:06,751 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:06,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash 72909321, now seen corresponding path program 1 times [2025-03-16 14:05:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:06,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722876092] [2025-03-16 14:05:06,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:06,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 14:05:06,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 14:05:06,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:06,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:06,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:06,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722876092] [2025-03-16 14:05:06,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722876092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:06,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:06,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213709577] [2025-03-16 14:05:06,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:06,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:06,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:06,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:06,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,771 INFO L87 Difference]: Start difference. First operand 2948 states and 3522 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:06,835 INFO L93 Difference]: Finished difference Result 4424 states and 5252 transitions. [2025-03-16 14:05:06,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:06,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 14:05:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:06,843 INFO L225 Difference]: With dead ends: 4424 [2025-03-16 14:05:06,843 INFO L226 Difference]: Without dead ends: 3014 [2025-03-16 14:05:06,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,846 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 34 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:06,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 102 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2025-03-16 14:05:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2025-03-16 14:05:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 3011 states have (on average 1.1697110594486881) internal successors, (3522), 3011 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3522 transitions. [2025-03-16 14:05:06,958 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3522 transitions. Word has length 21 [2025-03-16 14:05:06,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:06,958 INFO L471 AbstractCegarLoop]: Abstraction has 3012 states and 3522 transitions. [2025-03-16 14:05:06,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3522 transitions. [2025-03-16 14:05:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 14:05:06,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:06,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:06,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 14:05:06,962 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:06,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:06,962 INFO L85 PathProgramCache]: Analyzing trace with hash 201992040, now seen corresponding path program 1 times [2025-03-16 14:05:06,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:06,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60374722] [2025-03-16 14:05:06,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:06,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:06,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 14:05:06,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 14:05:06,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:06,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:06,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:06,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60374722] [2025-03-16 14:05:06,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60374722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:06,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:06,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001825620] [2025-03-16 14:05:06,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:06,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:06,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:06,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:06,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:06,981 INFO L87 Difference]: Start difference. First operand 3012 states and 3522 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:07,039 INFO L93 Difference]: Finished difference Result 4870 states and 5635 transitions. [2025-03-16 14:05:07,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:07,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 14:05:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:07,051 INFO L225 Difference]: With dead ends: 4870 [2025-03-16 14:05:07,051 INFO L226 Difference]: Without dead ends: 4868 [2025-03-16 14:05:07,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:07,054 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:07,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 86 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2025-03-16 14:05:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4612. [2025-03-16 14:05:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 4611 states have (on average 1.1385816525699415) internal successors, (5250), 4611 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5250 transitions. [2025-03-16 14:05:07,141 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5250 transitions. Word has length 21 [2025-03-16 14:05:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:07,141 INFO L471 AbstractCegarLoop]: Abstraction has 4612 states and 5250 transitions. [2025-03-16 14:05:07,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5250 transitions. [2025-03-16 14:05:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 14:05:07,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:07,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:07,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 14:05:07,146 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:07,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1594959319, now seen corresponding path program 1 times [2025-03-16 14:05:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:05:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952024749] [2025-03-16 14:05:07,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:05:07,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 14:05:07,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 14:05:07,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:07,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:05:07,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:05:07,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952024749] [2025-03-16 14:05:07,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952024749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:07,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:07,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:05:07,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089095174] [2025-03-16 14:05:07,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:07,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:05:07,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:05:07,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:05:07,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:07,165 INFO L87 Difference]: Start difference. First operand 4612 states and 5250 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:07,263 INFO L93 Difference]: Finished difference Result 10244 states and 11394 transitions. [2025-03-16 14:05:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:05:07,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-03-16 14:05:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:07,267 INFO L225 Difference]: With dead ends: 10244 [2025-03-16 14:05:07,267 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:05:07,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:05:07,275 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:07,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:05:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:05:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:05:07,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2025-03-16 14:05:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:07,276 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:05:07,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:05:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:05:07,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:05:07,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:05:07,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 14:05:07,281 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] [2025-03-16 14:05:07,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:05:07,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:05:07,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:05:07 BoogieIcfgContainer [2025-03-16 14:05:07,302 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:05:07,303 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:05:07,303 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:05:07,303 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:05:07,304 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:05:04" (3/4) ... [2025-03-16 14:05:07,306 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:05:07,316 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-16 14:05:07,316 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:05:07,316 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:05:07,317 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:05:07,381 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:05:07,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:05:07,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:05:07,383 INFO L158 Benchmark]: Toolchain (without parser) took 3001.11ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 106.4MB in the beginning and 251.1MB in the end (delta: -144.7MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2025-03-16 14:05:07,383 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:05:07,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.07ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.0MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:05:07,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.42ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 93.5MB in the end (delta: 501.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:05:07,386 INFO L158 Benchmark]: Boogie Preprocessor took 29.87ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:05:07,386 INFO L158 Benchmark]: IcfgBuilder took 257.78ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 78.3MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:05:07,386 INFO L158 Benchmark]: TraceAbstraction took 2432.92ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 77.2MB in the beginning and 256.0MB in the end (delta: -178.7MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2025-03-16 14:05:07,386 INFO L158 Benchmark]: Witness Printer took 78.84ms. Allocated memory is still 335.5MB. Free memory was 256.0MB in the beginning and 251.1MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:05:07,387 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.32ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.07ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.0MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.42ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 93.5MB in the end (delta: 501.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.87ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 257.78ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 78.3MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2432.92ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 77.2MB in the beginning and 256.0MB in the end (delta: -178.7MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Witness Printer took 78.84ms. Allocated memory is still 335.5MB. Free memory was 256.0MB in the beginning and 251.1MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: 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, 33 locations, 58 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 755 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 755 mSDsluCounter, 2489 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 984 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 1505 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4612occurred in iteration=22, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 1046 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-16 14:05:07,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE