./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_11.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:49:25,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:49:25,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:49:25,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:49:25,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:49:25,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:49:25,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:49:25,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:49:25,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:49:25,717 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:49:25,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:49:25,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:49:25,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:49:25,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:49:25,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:49:25,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:49:25,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:25,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:25,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:49:25,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:49:25,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:49:25,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:49:25,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:49:25,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:49:25,721 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2025-01-08 22:49:25,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:49:25,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:49:25,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:49:25,956 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:49:25,956 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:49:25,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2025-01-08 22:49:27,138 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72cd5fccb/0db2695b3d1c43e0a29e62af31febdbb/FLAGe92f4434f [2025-01-08 22:49:27,390 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:49:27,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2025-01-08 22:49:27,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72cd5fccb/0db2695b3d1c43e0a29e62af31febdbb/FLAGe92f4434f [2025-01-08 22:49:27,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72cd5fccb/0db2695b3d1c43e0a29e62af31febdbb [2025-01-08 22:49:27,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:49:27,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:49:27,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:49:27,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:49:27,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:49:27,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a93ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27, skipping insertion in model container [2025-01-08 22:49:27,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:49:27,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2025-01-08 22:49:27,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:49:27,580 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:49:27,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2025-01-08 22:49:27,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:49:27,614 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:49:27,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27 WrapperNode [2025-01-08 22:49:27,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:49:27,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:49:27,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:49:27,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:49:27,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,643 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 157 [2025-01-08 22:49:27,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:49:27,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:49:27,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:49:27,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:49:27,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,663 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-01-08 22:49:27,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:49:27,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:49:27,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:49:27,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:49:27,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (1/1) ... [2025-01-08 22:49:27,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:27,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:27,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:49:27,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:49:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:49:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:49:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:49:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:49:27,787 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:49:27,789 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:49:27,970 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-01-08 22:49:27,970 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:49:27,977 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:49:27,977 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:49:27,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:49:27 BoogieIcfgContainer [2025-01-08 22:49:27,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:49:27,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:49:27,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:49:27,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:49:27,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:49:27" (1/3) ... [2025-01-08 22:49:27,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18154745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:49:27, skipping insertion in model container [2025-01-08 22:49:27,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:27" (2/3) ... [2025-01-08 22:49:27,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18154745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:49:27, skipping insertion in model container [2025-01-08 22:49:27,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:49:27" (3/3) ... [2025-01-08 22:49:27,986 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2025-01-08 22:49:27,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:49:28,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_11.c that has 1 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:49:28,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:49:28,055 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;@4ade4f11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:49:28,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:49:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 42 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-08 22:49:28,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:28,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:28,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:28,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash -978715967, now seen corresponding path program 1 times [2025-01-08 22:49:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361500897] [2025-01-08 22:49:28,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:28,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-08 22:49:28,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-08 22:49:28,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:28,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:28,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:28,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361500897] [2025-01-08 22:49:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361500897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:28,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:28,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:28,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295009536] [2025-01-08 22:49:28,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:28,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:28,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:28,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:28,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:28,282 INFO L87 Difference]: Start difference. First operand has 43 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 42 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.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-01-08 22:49:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:28,323 INFO L93 Difference]: Finished difference Result 122 states and 224 transitions. [2025-01-08 22:49:28,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:28,325 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-01-08 22:49:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:28,331 INFO L225 Difference]: With dead ends: 122 [2025-01-08 22:49:28,332 INFO L226 Difference]: Without dead ends: 75 [2025-01-08 22:49:28,335 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-01-08 22:49:28,338 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:28,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 149 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-08 22:49:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-01-08 22:49:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.875) internal successors, (135), 72 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 135 transitions. [2025-01-08 22:49:28,363 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 135 transitions. Word has length 18 [2025-01-08 22:49:28,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:28,363 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 135 transitions. [2025-01-08 22:49:28,363 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-01-08 22:49:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 135 transitions. [2025-01-08 22:49:28,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-08 22:49:28,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:28,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:28,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:49:28,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:28,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:28,365 INFO L85 PathProgramCache]: Analyzing trace with hash 32401283, now seen corresponding path program 1 times [2025-01-08 22:49:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:28,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651285568] [2025-01-08 22:49:28,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:28,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-08 22:49:28,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-08 22:49:28,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:28,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:28,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651285568] [2025-01-08 22:49:28,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651285568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:28,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:28,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8692749] [2025-01-08 22:49:28,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:28,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:28,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:28,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:28,431 INFO L87 Difference]: Start difference. First operand 73 states and 135 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-01-08 22:49:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:28,452 INFO L93 Difference]: Finished difference Result 99 states and 179 transitions. [2025-01-08 22:49:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:28,453 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-01-08 22:49:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:28,454 INFO L225 Difference]: With dead ends: 99 [2025-01-08 22:49:28,454 INFO L226 Difference]: Without dead ends: 97 [2025-01-08 22:49:28,454 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-01-08 22:49:28,454 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:28,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 198 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-08 22:49:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2025-01-08 22:49:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 134 transitions. [2025-01-08 22:49:28,463 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 134 transitions. Word has length 18 [2025-01-08 22:49:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:28,463 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 134 transitions. [2025-01-08 22:49:28,463 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-01-08 22:49:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 134 transitions. [2025-01-08 22:49:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:49:28,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:28,464 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-01-08 22:49:28,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:49:28,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:28,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:28,464 INFO L85 PathProgramCache]: Analyzing trace with hash -275210886, now seen corresponding path program 1 times [2025-01-08 22:49:28,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:28,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931846944] [2025-01-08 22:49:28,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:28,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:49:28,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:49:28,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:28,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:28,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:28,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931846944] [2025-01-08 22:49:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931846944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:28,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:28,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:28,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104514093] [2025-01-08 22:49:28,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:28,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:28,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:28,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:28,527 INFO L87 Difference]: Start difference. First operand 73 states and 134 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-01-08 22:49:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:28,551 INFO L93 Difference]: Finished difference Result 142 states and 260 transitions. [2025-01-08 22:49:28,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:28,551 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-01-08 22:49:28,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:28,552 INFO L225 Difference]: With dead ends: 142 [2025-01-08 22:49:28,552 INFO L226 Difference]: Without dead ends: 140 [2025-01-08 22:49:28,552 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-01-08 22:49:28,553 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 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-01-08 22:49:28,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:28,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-08 22:49:28,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 98. [2025-01-08 22:49:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8556701030927836) internal successors, (180), 97 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 180 transitions. [2025-01-08 22:49:28,567 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 180 transitions. Word has length 19 [2025-01-08 22:49:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:28,567 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 180 transitions. [2025-01-08 22:49:28,567 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-01-08 22:49:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 180 transitions. [2025-01-08 22:49:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:49:28,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:28,567 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-01-08 22:49:28,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:49:28,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:28,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1286328136, now seen corresponding path program 1 times [2025-01-08 22:49:28,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:28,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403819757] [2025-01-08 22:49:28,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:28,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:28,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:49:28,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:49:28,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:28,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:28,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:28,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403819757] [2025-01-08 22:49:28,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403819757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:28,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:28,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:28,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275521048] [2025-01-08 22:49:28,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:28,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:28,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:28,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:28,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:28,628 INFO L87 Difference]: Start difference. First operand 98 states and 180 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-01-08 22:49:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:28,651 INFO L93 Difference]: Finished difference Result 238 states and 438 transitions. [2025-01-08 22:49:28,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:28,652 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-01-08 22:49:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:28,652 INFO L225 Difference]: With dead ends: 238 [2025-01-08 22:49:28,652 INFO L226 Difference]: Without dead ends: 142 [2025-01-08 22:49:28,654 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-01-08 22:49:28,656 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 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-01-08 22:49:28,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:28,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-08 22:49:28,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2025-01-08 22:49:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.8345323741007193) internal successors, (255), 139 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 255 transitions. [2025-01-08 22:49:28,669 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 255 transitions. Word has length 19 [2025-01-08 22:49:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:28,669 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 255 transitions. [2025-01-08 22:49:28,669 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-01-08 22:49:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 255 transitions. [2025-01-08 22:49:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:49:28,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:28,669 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-01-08 22:49:28,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:49:28,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:28,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:28,670 INFO L85 PathProgramCache]: Analyzing trace with hash 58610486, now seen corresponding path program 1 times [2025-01-08 22:49:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:28,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849879482] [2025-01-08 22:49:28,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:28,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:28,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:49:28,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:49:28,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:28,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849879482] [2025-01-08 22:49:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849879482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:28,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:28,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042030987] [2025-01-08 22:49:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:28,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:28,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:28,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:28,740 INFO L87 Difference]: Start difference. First operand 140 states and 255 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-01-08 22:49:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:28,764 INFO L93 Difference]: Finished difference Result 216 states and 388 transitions. [2025-01-08 22:49:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:28,764 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-01-08 22:49:28,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:28,765 INFO L225 Difference]: With dead ends: 216 [2025-01-08 22:49:28,765 INFO L226 Difference]: Without dead ends: 147 [2025-01-08 22:49:28,765 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-01-08 22:49:28,766 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:28,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-08 22:49:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2025-01-08 22:49:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7986111111111112) internal successors, (259), 144 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2025-01-08 22:49:28,776 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 20 [2025-01-08 22:49:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:28,776 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2025-01-08 22:49:28,776 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-01-08 22:49:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2025-01-08 22:49:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:49:28,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:28,777 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-01-08 22:49:28,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:49:28,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:28,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1221253192, now seen corresponding path program 1 times [2025-01-08 22:49:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054939354] [2025-01-08 22:49:28,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:28,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:49:28,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:49:28,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:28,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:28,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:28,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054939354] [2025-01-08 22:49:28,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054939354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:28,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:28,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:28,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442688938] [2025-01-08 22:49:28,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:28,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:28,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:28,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:28,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:28,813 INFO L87 Difference]: Start difference. First operand 145 states and 259 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-01-08 22:49:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:28,825 INFO L93 Difference]: Finished difference Result 273 states and 491 transitions. [2025-01-08 22:49:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:28,825 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-01-08 22:49:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:28,826 INFO L225 Difference]: With dead ends: 273 [2025-01-08 22:49:28,826 INFO L226 Difference]: Without dead ends: 271 [2025-01-08 22:49:28,826 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-01-08 22:49:28,827 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 135 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-01-08 22:49:28,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-08 22:49:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 197. [2025-01-08 22:49:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.780612244897959) internal successors, (349), 196 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 349 transitions. [2025-01-08 22:49:28,850 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 349 transitions. Word has length 20 [2025-01-08 22:49:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:28,850 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 349 transitions. [2025-01-08 22:49:28,850 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-01-08 22:49:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 349 transitions. [2025-01-08 22:49:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:49:28,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:28,851 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-01-08 22:49:28,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:49:28,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:28,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2062596854, now seen corresponding path program 1 times [2025-01-08 22:49:28,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:28,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559174340] [2025-01-08 22:49:28,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:28,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:49:28,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:49:28,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:28,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:28,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:28,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559174340] [2025-01-08 22:49:28,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559174340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:28,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:28,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:28,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961493220] [2025-01-08 22:49:28,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:28,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:28,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:28,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:28,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:28,885 INFO L87 Difference]: Start difference. First operand 197 states and 349 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-01-08 22:49:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:28,904 INFO L93 Difference]: Finished difference Result 469 states and 835 transitions. [2025-01-08 22:49:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:28,904 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-01-08 22:49:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:28,906 INFO L225 Difference]: With dead ends: 469 [2025-01-08 22:49:28,906 INFO L226 Difference]: Without dead ends: 279 [2025-01-08 22:49:28,906 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-01-08 22:49:28,909 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 159 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-01-08 22:49:28,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 159 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:28,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-08 22:49:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-01-08 22:49:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.7644927536231885) internal successors, (487), 276 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 487 transitions. [2025-01-08 22:49:28,925 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 487 transitions. Word has length 20 [2025-01-08 22:49:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:28,926 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 487 transitions. [2025-01-08 22:49:28,926 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-01-08 22:49:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 487 transitions. [2025-01-08 22:49:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:49:28,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:28,930 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-01-08 22:49:28,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:49:28,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:28,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash 796070413, now seen corresponding path program 1 times [2025-01-08 22:49:28,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:28,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987529604] [2025-01-08 22:49:28,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:28,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:28,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:49:28,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:49:28,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:28,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:28,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:28,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987529604] [2025-01-08 22:49:28,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987529604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:28,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:28,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762860842] [2025-01-08 22:49:28,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:28,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:28,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:28,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:28,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:28,968 INFO L87 Difference]: Start difference. First operand 277 states and 487 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-01-08 22:49:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:28,990 INFO L93 Difference]: Finished difference Result 417 states and 729 transitions. [2025-01-08 22:49:28,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:28,991 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-01-08 22:49:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:28,992 INFO L225 Difference]: With dead ends: 417 [2025-01-08 22:49:28,992 INFO L226 Difference]: Without dead ends: 283 [2025-01-08 22:49:28,992 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-01-08 22:49:28,993 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 53 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:28,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-01-08 22:49:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2025-01-08 22:49:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.7392857142857143) internal successors, (487), 280 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 487 transitions. [2025-01-08 22:49:29,006 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 487 transitions. Word has length 21 [2025-01-08 22:49:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:29,008 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 487 transitions. [2025-01-08 22:49:29,009 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-01-08 22:49:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 487 transitions. [2025-01-08 22:49:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:49:29,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:29,009 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-01-08 22:49:29,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:49:29,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:29,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash -483793265, now seen corresponding path program 1 times [2025-01-08 22:49:29,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:29,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132347232] [2025-01-08 22:49:29,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:29,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:29,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:49:29,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:49:29,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:29,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:29,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132347232] [2025-01-08 22:49:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132347232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:29,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:29,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:29,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729471123] [2025-01-08 22:49:29,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:29,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:29,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:29,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:29,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:29,044 INFO L87 Difference]: Start difference. First operand 281 states and 487 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-01-08 22:49:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:29,061 INFO L93 Difference]: Finished difference Result 521 states and 913 transitions. [2025-01-08 22:49:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:29,061 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-01-08 22:49:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:29,063 INFO L225 Difference]: With dead ends: 521 [2025-01-08 22:49:29,063 INFO L226 Difference]: Without dead ends: 519 [2025-01-08 22:49:29,063 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-01-08 22:49:29,064 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 133 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-01-08 22:49:29,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-01-08 22:49:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 389. [2025-01-08 22:49:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.708762886597938) internal successors, (663), 388 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 663 transitions. [2025-01-08 22:49:29,073 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 663 transitions. Word has length 21 [2025-01-08 22:49:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:29,073 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 663 transitions. [2025-01-08 22:49:29,073 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-01-08 22:49:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 663 transitions. [2025-01-08 22:49:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:49:29,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:29,074 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-01-08 22:49:29,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:49:29,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:29,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1494910515, now seen corresponding path program 1 times [2025-01-08 22:49:29,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:29,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381397503] [2025-01-08 22:49:29,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:29,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:29,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:49:29,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:49:29,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:29,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:29,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:29,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381397503] [2025-01-08 22:49:29,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381397503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:29,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:29,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:29,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651611590] [2025-01-08 22:49:29,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:29,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:29,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:29,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:29,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:29,106 INFO L87 Difference]: Start difference. First operand 389 states and 663 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-01-08 22:49:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:29,129 INFO L93 Difference]: Finished difference Result 921 states and 1577 transitions. [2025-01-08 22:49:29,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:29,130 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-01-08 22:49:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:29,131 INFO L225 Difference]: With dead ends: 921 [2025-01-08 22:49:29,131 INFO L226 Difference]: Without dead ends: 543 [2025-01-08 22:49:29,133 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-01-08 22:49:29,133 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 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-01-08 22:49:29,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-01-08 22:49:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2025-01-08 22:49:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.6944444444444444) internal successors, (915), 540 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 915 transitions. [2025-01-08 22:49:29,154 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 915 transitions. Word has length 21 [2025-01-08 22:49:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:29,154 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 915 transitions. [2025-01-08 22:49:29,154 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-01-08 22:49:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 915 transitions. [2025-01-08 22:49:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:49:29,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:29,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:29,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:49:29,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:29,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:29,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2112475285, now seen corresponding path program 1 times [2025-01-08 22:49:29,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:29,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204179133] [2025-01-08 22:49:29,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:29,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:29,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:49:29,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:49:29,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:29,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:29,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:29,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204179133] [2025-01-08 22:49:29,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204179133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:29,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:29,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:29,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803322784] [2025-01-08 22:49:29,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:29,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:29,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:29,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:29,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:29,187 INFO L87 Difference]: Start difference. First operand 541 states and 915 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:29,208 INFO L93 Difference]: Finished difference Result 813 states and 1369 transitions. [2025-01-08 22:49:29,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:29,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-08 22:49:29,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:29,210 INFO L225 Difference]: With dead ends: 813 [2025-01-08 22:49:29,210 INFO L226 Difference]: Without dead ends: 551 [2025-01-08 22:49:29,211 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-01-08 22:49:29,213 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 164 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-01-08 22:49:29,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-08 22:49:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2025-01-08 22:49:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 915 transitions. [2025-01-08 22:49:29,237 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 915 transitions. Word has length 22 [2025-01-08 22:49:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:29,237 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 915 transitions. [2025-01-08 22:49:29,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 915 transitions. [2025-01-08 22:49:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:49:29,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:29,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:29,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:49:29,238 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:29,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash 902628333, now seen corresponding path program 1 times [2025-01-08 22:49:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:29,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856396269] [2025-01-08 22:49:29,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:29,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:49:29,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:49:29,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:29,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:29,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:29,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856396269] [2025-01-08 22:49:29,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856396269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:29,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:29,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:29,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394830961] [2025-01-08 22:49:29,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:29,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:29,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:29,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:29,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:29,262 INFO L87 Difference]: Start difference. First operand 549 states and 915 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:29,290 INFO L93 Difference]: Finished difference Result 1001 states and 1693 transitions. [2025-01-08 22:49:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:29,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-08 22:49:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:29,293 INFO L225 Difference]: With dead ends: 1001 [2025-01-08 22:49:29,293 INFO L226 Difference]: Without dead ends: 999 [2025-01-08 22:49:29,294 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-01-08 22:49:29,294 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 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-01-08 22:49:29,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-01-08 22:49:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 773. [2025-01-08 22:49:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1259 transitions. [2025-01-08 22:49:29,317 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1259 transitions. Word has length 22 [2025-01-08 22:49:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:29,317 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1259 transitions. [2025-01-08 22:49:29,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1259 transitions. [2025-01-08 22:49:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:49:29,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:29,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:29,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:49:29,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:29,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash -108488917, now seen corresponding path program 1 times [2025-01-08 22:49:29,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:29,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689546604] [2025-01-08 22:49:29,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:29,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:29,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:49:29,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:49:29,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:29,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:29,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:29,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689546604] [2025-01-08 22:49:29,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689546604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:29,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:29,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660093248] [2025-01-08 22:49:29,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:29,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:29,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:29,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:29,343 INFO L87 Difference]: Start difference. First operand 773 states and 1259 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:29,367 INFO L93 Difference]: Finished difference Result 1817 states and 2973 transitions. [2025-01-08 22:49:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:29,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-08 22:49:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:29,371 INFO L225 Difference]: With dead ends: 1817 [2025-01-08 22:49:29,371 INFO L226 Difference]: Without dead ends: 1063 [2025-01-08 22:49:29,371 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-01-08 22:49:29,372 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 161 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-01-08 22:49:29,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:29,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2025-01-08 22:49:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2025-01-08 22:49:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1715 transitions. [2025-01-08 22:49:29,400 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1715 transitions. Word has length 22 [2025-01-08 22:49:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:29,400 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1715 transitions. [2025-01-08 22:49:29,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1715 transitions. [2025-01-08 22:49:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 22:49:29,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:29,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:29,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:49:29,403 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:29,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:29,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2083078366, now seen corresponding path program 1 times [2025-01-08 22:49:29,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:29,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7272594] [2025-01-08 22:49:29,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:29,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:29,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 22:49:29,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 22:49:29,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:29,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7272594] [2025-01-08 22:49:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7272594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422104195] [2025-01-08 22:49:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:29,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:29,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:29,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:29,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:29,428 INFO L87 Difference]: Start difference. First operand 1061 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:29,458 INFO L93 Difference]: Finished difference Result 1593 states and 2565 transitions. [2025-01-08 22:49:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:29,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-08 22:49:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:29,461 INFO L225 Difference]: With dead ends: 1593 [2025-01-08 22:49:29,462 INFO L226 Difference]: Without dead ends: 1079 [2025-01-08 22:49:29,465 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-01-08 22:49:29,465 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:29,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2025-01-08 22:49:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2025-01-08 22:49:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1715 transitions. [2025-01-08 22:49:29,494 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1715 transitions. Word has length 23 [2025-01-08 22:49:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:29,495 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1715 transitions. [2025-01-08 22:49:29,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1715 transitions. [2025-01-08 22:49:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 22:49:29,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:29,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:29,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:49:29,497 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:29,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:29,497 INFO L85 PathProgramCache]: Analyzing trace with hash 932025252, now seen corresponding path program 1 times [2025-01-08 22:49:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727290221] [2025-01-08 22:49:29,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:29,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 22:49:29,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 22:49:29,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:29,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:29,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:29,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727290221] [2025-01-08 22:49:29,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727290221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:29,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:29,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9250408] [2025-01-08 22:49:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:29,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:29,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:29,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:29,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:29,518 INFO L87 Difference]: Start difference. First operand 1077 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:29,549 INFO L93 Difference]: Finished difference Result 1929 states and 3125 transitions. [2025-01-08 22:49:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:29,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-08 22:49:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:29,555 INFO L225 Difference]: With dead ends: 1929 [2025-01-08 22:49:29,555 INFO L226 Difference]: Without dead ends: 1927 [2025-01-08 22:49:29,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:29,557 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 129 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-01-08 22:49:29,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 129 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2025-01-08 22:49:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1541. [2025-01-08 22:49:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2387 transitions. [2025-01-08 22:49:29,602 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2387 transitions. Word has length 23 [2025-01-08 22:49:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:29,602 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 2387 transitions. [2025-01-08 22:49:29,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2387 transitions. [2025-01-08 22:49:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 22:49:29,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:29,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:29,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:49:29,604 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:29,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash -79091998, now seen corresponding path program 1 times [2025-01-08 22:49:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567961255] [2025-01-08 22:49:29,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:29,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 22:49:29,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 22:49:29,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:29,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:29,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567961255] [2025-01-08 22:49:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567961255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:29,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:29,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236379065] [2025-01-08 22:49:29,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:29,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:29,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:29,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:29,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:29,624 INFO L87 Difference]: Start difference. First operand 1541 states and 2387 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:29,669 INFO L93 Difference]: Finished difference Result 3593 states and 5589 transitions. [2025-01-08 22:49:29,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:29,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-08 22:49:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:29,675 INFO L225 Difference]: With dead ends: 3593 [2025-01-08 22:49:29,675 INFO L226 Difference]: Without dead ends: 2087 [2025-01-08 22:49:29,677 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-01-08 22:49:29,678 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 162 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-01-08 22:49:29,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:29,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2025-01-08 22:49:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2085. [2025-01-08 22:49:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3203 transitions. [2025-01-08 22:49:29,728 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3203 transitions. Word has length 23 [2025-01-08 22:49:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:29,728 INFO L471 AbstractCegarLoop]: Abstraction has 2085 states and 3203 transitions. [2025-01-08 22:49:29,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3203 transitions. [2025-01-08 22:49:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:29,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:29,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:29,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:49:29,731 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:29,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1171773536, now seen corresponding path program 1 times [2025-01-08 22:49:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909299190] [2025-01-08 22:49:29,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:29,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:29,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:29,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:29,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:29,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:29,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909299190] [2025-01-08 22:49:29,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909299190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:29,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:29,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:29,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225799195] [2025-01-08 22:49:29,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:29,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:29,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:29,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:29,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:29,756 INFO L87 Difference]: Start difference. First operand 2085 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:29,792 INFO L93 Difference]: Finished difference Result 3129 states and 4789 transitions. [2025-01-08 22:49:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:29,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-08 22:49:29,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:29,798 INFO L225 Difference]: With dead ends: 3129 [2025-01-08 22:49:29,798 INFO L226 Difference]: Without dead ends: 2119 [2025-01-08 22:49:29,800 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-01-08 22:49:29,800 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:29,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:29,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2025-01-08 22:49:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2117. [2025-01-08 22:49:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3203 transitions. [2025-01-08 22:49:29,865 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3203 transitions. Word has length 24 [2025-01-08 22:49:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:29,865 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3203 transitions. [2025-01-08 22:49:29,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3203 transitions. [2025-01-08 22:49:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:29,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:29,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:29,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:49:29,868 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:29,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1843330082, now seen corresponding path program 1 times [2025-01-08 22:49:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:29,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943729196] [2025-01-08 22:49:29,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:29,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:29,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:29,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:29,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:29,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:29,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:29,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943729196] [2025-01-08 22:49:29,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943729196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:29,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:29,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:29,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611568146] [2025-01-08 22:49:29,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:29,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:29,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:29,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:29,886 INFO L87 Difference]: Start difference. First operand 2117 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:29,938 INFO L93 Difference]: Finished difference Result 3721 states and 5733 transitions. [2025-01-08 22:49:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:29,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-08 22:49:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:29,948 INFO L225 Difference]: With dead ends: 3721 [2025-01-08 22:49:29,948 INFO L226 Difference]: Without dead ends: 3719 [2025-01-08 22:49:29,950 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-01-08 22:49:29,950 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 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-01-08 22:49:29,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-01-08 22:49:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3077. [2025-01-08 22:49:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4515 transitions. [2025-01-08 22:49:30,037 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4515 transitions. Word has length 24 [2025-01-08 22:49:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:30,037 INFO L471 AbstractCegarLoop]: Abstraction has 3077 states and 4515 transitions. [2025-01-08 22:49:30,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4515 transitions. [2025-01-08 22:49:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:30,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:30,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:30,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:49:30,041 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:30,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash 832212832, now seen corresponding path program 1 times [2025-01-08 22:49:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:30,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560964435] [2025-01-08 22:49:30,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:30,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:30,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:30,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:30,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:30,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:30,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:30,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560964435] [2025-01-08 22:49:30,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560964435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:30,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:30,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:30,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885570262] [2025-01-08 22:49:30,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:30,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:30,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:30,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:30,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:30,066 INFO L87 Difference]: Start difference. First operand 3077 states and 4515 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:30,129 INFO L93 Difference]: Finished difference Result 7113 states and 10469 transitions. [2025-01-08 22:49:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:30,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-08 22:49:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:30,140 INFO L225 Difference]: With dead ends: 7113 [2025-01-08 22:49:30,140 INFO L226 Difference]: Without dead ends: 4103 [2025-01-08 22:49:30,143 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-01-08 22:49:30,143 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:30,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2025-01-08 22:49:30,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4101. [2025-01-08 22:49:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5955 transitions. [2025-01-08 22:49:30,250 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5955 transitions. Word has length 24 [2025-01-08 22:49:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:30,250 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 5955 transitions. [2025-01-08 22:49:30,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5955 transitions. [2025-01-08 22:49:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:30,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:30,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:30,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 22:49:30,254 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:30,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1308872759, now seen corresponding path program 1 times [2025-01-08 22:49:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571705551] [2025-01-08 22:49:30,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:30,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:30,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:30,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:30,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:30,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:30,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:30,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571705551] [2025-01-08 22:49:30,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571705551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:30,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:30,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590775141] [2025-01-08 22:49:30,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:30,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:30,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:30,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:30,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:30,277 INFO L87 Difference]: Start difference. First operand 4101 states and 5955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:30,352 INFO L93 Difference]: Finished difference Result 6153 states and 8901 transitions. [2025-01-08 22:49:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:30,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-08 22:49:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:30,372 INFO L225 Difference]: With dead ends: 6153 [2025-01-08 22:49:30,372 INFO L226 Difference]: Without dead ends: 4167 [2025-01-08 22:49:30,375 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-01-08 22:49:30,375 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:30,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2025-01-08 22:49:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4165. [2025-01-08 22:49:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5955 transitions. [2025-01-08 22:49:30,480 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5955 transitions. Word has length 25 [2025-01-08 22:49:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:30,481 INFO L471 AbstractCegarLoop]: Abstraction has 4165 states and 5955 transitions. [2025-01-08 22:49:30,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5955 transitions. [2025-01-08 22:49:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:30,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:30,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:30,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 22:49:30,483 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:30,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash 29009081, now seen corresponding path program 1 times [2025-01-08 22:49:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:30,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440996679] [2025-01-08 22:49:30,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:30,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:30,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:30,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:30,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:30,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:30,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:30,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440996679] [2025-01-08 22:49:30,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440996679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:30,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:30,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:30,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190014106] [2025-01-08 22:49:30,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:30,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:30,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:30,501 INFO L87 Difference]: Start difference. First operand 4165 states and 5955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:30,603 INFO L93 Difference]: Finished difference Result 7177 states and 10437 transitions. [2025-01-08 22:49:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:30,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-08 22:49:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:30,615 INFO L225 Difference]: With dead ends: 7177 [2025-01-08 22:49:30,615 INFO L226 Difference]: Without dead ends: 7175 [2025-01-08 22:49:30,617 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-01-08 22:49:30,618 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:30,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 125 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7175 states. [2025-01-08 22:49:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7175 to 6149. [2025-01-08 22:49:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8515 transitions. [2025-01-08 22:49:30,764 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 8515 transitions. Word has length 25 [2025-01-08 22:49:30,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:30,765 INFO L471 AbstractCegarLoop]: Abstraction has 6149 states and 8515 transitions. [2025-01-08 22:49:30,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 8515 transitions. [2025-01-08 22:49:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:30,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:30,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:30,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:49:30,769 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:30,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash -982108169, now seen corresponding path program 1 times [2025-01-08 22:49:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:30,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470741280] [2025-01-08 22:49:30,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:30,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:30,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:30,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:30,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:30,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470741280] [2025-01-08 22:49:30,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470741280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:30,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:30,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:30,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137749501] [2025-01-08 22:49:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:30,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:30,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:30,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:30,787 INFO L87 Difference]: Start difference. First operand 6149 states and 8515 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:30,889 INFO L93 Difference]: Finished difference Result 14089 states and 19525 transitions. [2025-01-08 22:49:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:30,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-08 22:49:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:30,905 INFO L225 Difference]: With dead ends: 14089 [2025-01-08 22:49:30,905 INFO L226 Difference]: Without dead ends: 8071 [2025-01-08 22:49:30,913 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-01-08 22:49:30,914 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 164 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-01-08 22:49:30,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8071 states. [2025-01-08 22:49:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 8069. [2025-01-08 22:49:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 11011 transitions. [2025-01-08 22:49:31,088 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 11011 transitions. Word has length 25 [2025-01-08 22:49:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:31,088 INFO L471 AbstractCegarLoop]: Abstraction has 8069 states and 11011 transitions. [2025-01-08 22:49:31,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 11011 transitions. [2025-01-08 22:49:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:31,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:31,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:31,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 22:49:31,094 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:31,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash 899496917, now seen corresponding path program 1 times [2025-01-08 22:49:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:31,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690823827] [2025-01-08 22:49:31,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:31,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:31,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:31,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:31,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:31,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690823827] [2025-01-08 22:49:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690823827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:31,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:31,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522898931] [2025-01-08 22:49:31,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:31,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:31,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:31,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:31,109 INFO L87 Difference]: Start difference. First operand 8069 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:31,243 INFO L93 Difference]: Finished difference Result 12105 states and 16453 transitions. [2025-01-08 22:49:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:31,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-08 22:49:31,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:31,256 INFO L225 Difference]: With dead ends: 12105 [2025-01-08 22:49:31,257 INFO L226 Difference]: Without dead ends: 8199 [2025-01-08 22:49:31,262 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-01-08 22:49:31,263 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:31,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2025-01-08 22:49:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8197. [2025-01-08 22:49:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 11011 transitions. [2025-01-08 22:49:31,477 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 11011 transitions. Word has length 26 [2025-01-08 22:49:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:31,477 INFO L471 AbstractCegarLoop]: Abstraction has 8197 states and 11011 transitions. [2025-01-08 22:49:31,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 11011 transitions. [2025-01-08 22:49:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:31,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:31,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:31,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 22:49:31,484 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:31,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:31,485 INFO L85 PathProgramCache]: Analyzing trace with hash -380366761, now seen corresponding path program 1 times [2025-01-08 22:49:31,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825994666] [2025-01-08 22:49:31,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:31,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:31,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:31,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:31,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:31,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:31,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825994666] [2025-01-08 22:49:31,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825994666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:31,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:31,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:31,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155678087] [2025-01-08 22:49:31,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:31,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:31,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:31,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:31,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:31,508 INFO L87 Difference]: Start difference. First operand 8197 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:31,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:31,722 INFO L93 Difference]: Finished difference Result 23817 states and 31493 transitions. [2025-01-08 22:49:31,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:31,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-08 22:49:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:31,746 INFO L225 Difference]: With dead ends: 23817 [2025-01-08 22:49:31,746 INFO L226 Difference]: Without dead ends: 15879 [2025-01-08 22:49:31,754 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-01-08 22:49:31,755 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 139 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-01-08 22:49:31,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 139 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15879 states. [2025-01-08 22:49:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15879 to 15877. [2025-01-08 22:49:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15877 states, 15876 states have (on average 1.2901864449483498) internal successors, (20483), 15876 states have internal predecessors, (20483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 20483 transitions. [2025-01-08 22:49:32,062 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 20483 transitions. Word has length 26 [2025-01-08 22:49:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:32,062 INFO L471 AbstractCegarLoop]: Abstraction has 15877 states and 20483 transitions. [2025-01-08 22:49:32,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 20483 transitions. [2025-01-08 22:49:32,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:32,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:32,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:32,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-08 22:49:32,071 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:32,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash 630750489, now seen corresponding path program 1 times [2025-01-08 22:49:32,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:32,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039399109] [2025-01-08 22:49:32,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:32,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:32,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:32,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:32,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:32,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:32,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039399109] [2025-01-08 22:49:32,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039399109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:32,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:32,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:32,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846258374] [2025-01-08 22:49:32,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:32,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:32,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:32,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:32,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:32,090 INFO L87 Difference]: Start difference. First operand 15877 states and 20483 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:32,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:32,256 INFO L93 Difference]: Finished difference Result 17417 states and 23045 transitions. [2025-01-08 22:49:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:32,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-08 22:49:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:32,285 INFO L225 Difference]: With dead ends: 17417 [2025-01-08 22:49:32,285 INFO L226 Difference]: Without dead ends: 17415 [2025-01-08 22:49:32,289 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-01-08 22:49:32,290 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:32,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 158 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:32,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2025-01-08 22:49:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 15877. [2025-01-08 22:49:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15877 states, 15876 states have (on average 1.2740614764424287) internal successors, (20227), 15876 states have internal predecessors, (20227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:32,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 20227 transitions. [2025-01-08 22:49:32,592 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 20227 transitions. Word has length 26 [2025-01-08 22:49:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:32,593 INFO L471 AbstractCegarLoop]: Abstraction has 15877 states and 20227 transitions. [2025-01-08 22:49:32,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:32,593 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 20227 transitions. [2025-01-08 22:49:32,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:49:32,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:32,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:32,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-08 22:49:32,605 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:32,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1093748044, now seen corresponding path program 1 times [2025-01-08 22:49:32,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:32,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928888888] [2025-01-08 22:49:32,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:32,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:32,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:49:32,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:49:32,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:32,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:32,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:32,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928888888] [2025-01-08 22:49:32,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928888888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:32,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:32,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:32,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559944551] [2025-01-08 22:49:32,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:32,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:32,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:32,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:32,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:32,623 INFO L87 Difference]: Start difference. First operand 15877 states and 20227 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:32,972 INFO L93 Difference]: Finished difference Result 26377 states and 33797 transitions. [2025-01-08 22:49:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:32,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-08 22:49:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:33,015 INFO L225 Difference]: With dead ends: 26377 [2025-01-08 22:49:33,015 INFO L226 Difference]: Without dead ends: 26375 [2025-01-08 22:49:33,023 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-01-08 22:49:33,023 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:33,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26375 states. [2025-01-08 22:49:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26375 to 24325. [2025-01-08 22:49:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24325 states, 24324 states have (on average 1.2420243381022857) internal successors, (30211), 24324 states have internal predecessors, (30211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24325 states to 24325 states and 30211 transitions. [2025-01-08 22:49:33,412 INFO L78 Accepts]: Start accepts. Automaton has 24325 states and 30211 transitions. Word has length 27 [2025-01-08 22:49:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:33,412 INFO L471 AbstractCegarLoop]: Abstraction has 24325 states and 30211 transitions. [2025-01-08 22:49:33,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 24325 states and 30211 transitions. [2025-01-08 22:49:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:49:33,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:33,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:33,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-08 22:49:33,429 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:33,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 82630794, now seen corresponding path program 1 times [2025-01-08 22:49:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:33,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718398875] [2025-01-08 22:49:33,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:33,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:49:33,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:49:33,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:33,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:33,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718398875] [2025-01-08 22:49:33,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718398875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:33,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:33,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:33,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140520742] [2025-01-08 22:49:33,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:33,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:33,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:33,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:33,444 INFO L87 Difference]: Start difference. First operand 24325 states and 30211 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:33,731 INFO L93 Difference]: Finished difference Result 55049 states and 68101 transitions. [2025-01-08 22:49:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:33,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-08 22:49:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:33,770 INFO L225 Difference]: With dead ends: 55049 [2025-01-08 22:49:33,770 INFO L226 Difference]: Without dead ends: 30983 [2025-01-08 22:49:33,787 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-01-08 22:49:33,787 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 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-01-08 22:49:33,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30983 states. [2025-01-08 22:49:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30983 to 30981. [2025-01-08 22:49:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30981 states, 30980 states have (on average 1.206552614590058) internal successors, (37379), 30980 states have internal predecessors, (37379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30981 states to 30981 states and 37379 transitions. [2025-01-08 22:49:34,242 INFO L78 Accepts]: Start accepts. Automaton has 30981 states and 37379 transitions. Word has length 27 [2025-01-08 22:49:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:34,242 INFO L471 AbstractCegarLoop]: Abstraction has 30981 states and 37379 transitions. [2025-01-08 22:49:34,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 30981 states and 37379 transitions. [2025-01-08 22:49:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:49:34,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:34,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:34,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-08 22:49:34,258 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:34,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash -453332916, now seen corresponding path program 1 times [2025-01-08 22:49:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:34,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724369100] [2025-01-08 22:49:34,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:34,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:49:34,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:49:34,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:34,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:34,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724369100] [2025-01-08 22:49:34,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724369100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:34,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:34,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:34,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539254017] [2025-01-08 22:49:34,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:34,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:34,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:34,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:34,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:34,272 INFO L87 Difference]: Start difference. First operand 30981 states and 37379 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:34,492 INFO L93 Difference]: Finished difference Result 46857 states and 56581 transitions. [2025-01-08 22:49:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-08 22:49:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:34,528 INFO L225 Difference]: With dead ends: 46857 [2025-01-08 22:49:34,528 INFO L226 Difference]: Without dead ends: 31751 [2025-01-08 22:49:34,543 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-01-08 22:49:34,543 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 46 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:34,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:34,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31751 states. [2025-01-08 22:49:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31751 to 31749. [2025-01-08 22:49:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.1934925034647852) internal successors, (37891), 31748 states have internal predecessors, (37891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 37891 transitions. [2025-01-08 22:49:35,256 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 37891 transitions. Word has length 28 [2025-01-08 22:49:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:35,257 INFO L471 AbstractCegarLoop]: Abstraction has 31749 states and 37891 transitions. [2025-01-08 22:49:35,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 37891 transitions. [2025-01-08 22:49:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:49:35,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:35,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:35,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-08 22:49:35,273 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:35,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:35,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1733196594, now seen corresponding path program 1 times [2025-01-08 22:49:35,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:35,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542372225] [2025-01-08 22:49:35,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:35,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:35,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:49:35,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:49:35,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:35,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:35,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542372225] [2025-01-08 22:49:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542372225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:35,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276934953] [2025-01-08 22:49:35,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:35,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:35,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:35,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:35,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:35,292 INFO L87 Difference]: Start difference. First operand 31749 states and 37891 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:35,955 INFO L93 Difference]: Finished difference Result 51207 states and 60420 transitions. [2025-01-08 22:49:35,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:35,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-08 22:49:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:36,005 INFO L225 Difference]: With dead ends: 51207 [2025-01-08 22:49:36,005 INFO L226 Difference]: Without dead ends: 51205 [2025-01-08 22:49:36,013 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-01-08 22:49:36,017 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 22 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 118 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-01-08 22:49:36,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51205 states. [2025-01-08 22:49:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51205 to 49157. [2025-01-08 22:49:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49157 states, 49156 states have (on average 1.1666327610057776) internal successors, (57347), 49156 states have internal predecessors, (57347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49157 states to 49157 states and 57347 transitions. [2025-01-08 22:49:36,562 INFO L78 Accepts]: Start accepts. Automaton has 49157 states and 57347 transitions. Word has length 28 [2025-01-08 22:49:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:36,562 INFO L471 AbstractCegarLoop]: Abstraction has 49157 states and 57347 transitions. [2025-01-08 22:49:36,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 49157 states and 57347 transitions. [2025-01-08 22:49:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:49:36,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:36,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:36,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-08 22:49:36,592 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:36,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:36,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1550653452, now seen corresponding path program 1 times [2025-01-08 22:49:36,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:36,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139423526] [2025-01-08 22:49:36,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:36,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:36,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:49:36,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:49:36,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:36,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:36,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:36,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139423526] [2025-01-08 22:49:36,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139423526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:36,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:36,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551503053] [2025-01-08 22:49:36,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:36,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:36,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:36,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:36,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:36,609 INFO L87 Difference]: Start difference. First operand 49157 states and 57347 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:37,209 INFO L93 Difference]: Finished difference Result 109573 states and 125955 transitions. [2025-01-08 22:49:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:37,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-08 22:49:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:37,213 INFO L225 Difference]: With dead ends: 109573 [2025-01-08 22:49:37,213 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:49:37,246 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-01-08 22:49:37,247 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 42 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 165 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-01-08 22:49:37,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:49:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:49:37,247 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-01-08 22:49:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:49:37,249 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-01-08 22:49:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:37,249 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:49:37,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:49:37,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:49:37,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:49:37,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-08 22:49:37,255 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:37,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:49:37,267 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:49:37,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:49:37 BoogieIcfgContainer [2025-01-08 22:49:37,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:49:37,275 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:49:37,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:49:37,275 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:49:37,276 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:49:27" (3/4) ... [2025-01-08 22:49:37,278 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:49:37,288 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-08 22:49:37,288 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:49:37,288 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:49:37,288 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:49:37,350 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:49:37,350 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:49:37,350 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:49:37,351 INFO L158 Benchmark]: Toolchain (without parser) took 9930.36ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 135.1MB in the beginning and 894.3MB in the end (delta: -759.3MB). Peak memory consumption was 884.4MB. Max. memory is 16.1GB. [2025-01-08 22:49:37,351 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:49:37,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.53ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 123.3MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:49:37,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.69ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 121.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:49:37,352 INFO L158 Benchmark]: Boogie Preprocessor took 35.77ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 120.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:49:37,352 INFO L158 Benchmark]: RCFGBuilder took 297.37ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 105.3MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:49:37,353 INFO L158 Benchmark]: TraceAbstraction took 9294.86ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 104.8MB in the beginning and 902.7MB in the end (delta: -798.0MB). Peak memory consumption was 842.4MB. Max. memory is 16.1GB. [2025-01-08 22:49:37,355 INFO L158 Benchmark]: Witness Printer took 75.44ms. Allocated memory is still 1.8GB. Free memory was 902.7MB in the beginning and 894.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:49:37,356 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.53ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 123.3MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.69ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 121.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.77ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 120.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 297.37ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 105.3MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9294.86ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 104.8MB in the beginning and 902.7MB in the end (delta: -798.0MB). Peak memory consumption was 842.4MB. Max. memory is 16.1GB. * Witness Printer took 75.44ms. Allocated memory is still 1.8GB. Free memory was 902.7MB in the beginning and 894.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 177]: 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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1351 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1351 mSDsluCounter, 4518 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1808 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 161 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 2710 mSDtfsCounter, 161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49157occurred in iteration=29, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 30 MinimizatonAttempts, 8222 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 665 ConstructedInterpolants, 0 QuantifiedInterpolants, 1435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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-01-08 22:49:37,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE