./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_12.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_12.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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:49:33,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:49:33,596 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:33,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:49:33,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:49:33,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:49:33,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:49:33,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:49:33,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:49:33,618 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:49:33,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:49:33,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:49:33,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:49:33,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:49:33,618 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:49:33,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:49:33,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:49:33,618 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:49:33,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:49:33,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:49:33,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:49:33,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:33,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:33,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:49:33,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:49:33,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:49:33,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:49:33,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:49:33,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:49:33,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:49:33,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:49:33,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:49:33,620 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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2025-01-08 22:49:33,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:49:33,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:49:33,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:49:33,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:49:33,842 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:49:33,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2025-01-08 22:49:34,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edcddc4ba/99ed717048bf4524a196c848b7ddee8d/FLAG2e64c14e8 [2025-01-08 22:49:35,142 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:49:35,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2025-01-08 22:49:35,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edcddc4ba/99ed717048bf4524a196c848b7ddee8d/FLAG2e64c14e8 [2025-01-08 22:49:35,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edcddc4ba/99ed717048bf4524a196c848b7ddee8d [2025-01-08 22:49:35,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:49:35,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:49:35,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:49:35,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:49:35,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:49:35,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:49:35" (1/1) ... [2025-01-08 22:49:35,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d076140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:35, skipping insertion in model container [2025-01-08 22:49:35,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:49:35" (1/1) ... [2025-01-08 22:49:35,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:49:35,623 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_12.c[4591,4604] [2025-01-08 22:49:35,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:49:35,633 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:49:35,654 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_12.c[4591,4604] [2025-01-08 22:49:35,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:49:35,665 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:49:35,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:35 WrapperNode [2025-01-08 22:49:35,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:49:35,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:49:35,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:49:35,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:49:35,672 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:35" (1/1) ... [2025-01-08 22:49:35,676 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:35" (1/1) ... [2025-01-08 22:49:35,691 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2025-01-08 22:49:35,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:49:35,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:49:35,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:49:35,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:49:35,699 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:35" (1/1) ... [2025-01-08 22:49:35,699 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:35" (1/1) ... [2025-01-08 22:49:35,701 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:35" (1/1) ... [2025-01-08 22:49:35,711 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:35,716 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:35" (1/1) ... [2025-01-08 22:49:35,716 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:35" (1/1) ... [2025-01-08 22:49:35,719 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:35" (1/1) ... [2025-01-08 22:49:35,723 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:35" (1/1) ... [2025-01-08 22:49:35,726 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:35" (1/1) ... [2025-01-08 22:49:35,730 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:35" (1/1) ... [2025-01-08 22:49:35,731 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:35" (1/1) ... [2025-01-08 22:49:35,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:49:35,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:49:35,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:49:35,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:49:35,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:35" (1/1) ... [2025-01-08 22:49:35,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:35,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:35,759 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:35,763 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:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:49:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:49:35,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:49:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:49:35,816 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:49:35,818 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:49:35,985 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-08 22:49:35,986 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:49:35,993 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:49:35,993 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:49:35,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:49:35 BoogieIcfgContainer [2025-01-08 22:49:35,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:49:35,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:49:35,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:49:35,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:49:35,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:49:35" (1/3) ... [2025-01-08 22:49:35,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617bd4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:49:35, skipping insertion in model container [2025-01-08 22:49:35,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:35" (2/3) ... [2025-01-08 22:49:35,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617bd4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:49:35, skipping insertion in model container [2025-01-08 22:49:35,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:49:35" (3/3) ... [2025-01-08 22:49:35,999 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2025-01-08 22:49:36,008 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:49:36,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_12.c that has 1 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:49:36,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:49:36,052 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;@75acb5b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:49:36,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:49:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 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,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:49:36,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:36,059 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:36,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:36,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash -275424366, now seen corresponding path program 1 times [2025-01-08 22:49:36,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:36,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334502312] [2025-01-08 22:49:36,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:36,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:49:36,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:49:36,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:36,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:36,228 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,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:36,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334502312] [2025-01-08 22:49:36,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334502312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:36,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:36,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:36,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185840048] [2025-01-08 22:49:36,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:36,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:36,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:36,249 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 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.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:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:36,287 INFO L93 Difference]: Finished difference Result 131 states and 242 transitions. [2025-01-08 22:49:36,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:36,288 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:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:36,295 INFO L225 Difference]: With dead ends: 131 [2025-01-08 22:49:36,295 INFO L226 Difference]: Without dead ends: 81 [2025-01-08 22:49:36,297 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,300 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 161 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:36,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 161 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:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-08 22:49:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-01-08 22:49:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.8846153846153846) internal successors, (147), 78 states have internal predecessors, (147), 0 states have call successors, (0), 0 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,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 147 transitions. [2025-01-08 22:49:36,331 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 147 transitions. Word has length 19 [2025-01-08 22:49:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:36,331 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 147 transitions. [2025-01-08 22:49:36,331 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:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 147 transitions. [2025-01-08 22:49:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:49:36,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:36,332 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:36,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:49:36,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:36,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1004439312, now seen corresponding path program 1 times [2025-01-08 22:49:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:36,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925887631] [2025-01-08 22:49:36,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:36,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:49:36,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:49:36,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:36,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:36,407 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,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925887631] [2025-01-08 22:49:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925887631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:36,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:36,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:36,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703742350] [2025-01-08 22:49:36,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:36,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:36,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:36,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:36,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:36,409 INFO L87 Difference]: Start difference. First operand 79 states and 147 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:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:36,428 INFO L93 Difference]: Finished difference Result 107 states and 195 transitions. [2025-01-08 22:49:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:36,429 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:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:36,429 INFO L225 Difference]: With dead ends: 107 [2025-01-08 22:49:36,429 INFO L226 Difference]: Without dead ends: 105 [2025-01-08 22:49:36,430 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,430 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 216 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:36,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 216 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:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-08 22:49:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 79. [2025-01-08 22:49:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 0 states have call successors, (0), 0 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,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2025-01-08 22:49:36,440 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 19 [2025-01-08 22:49:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:36,441 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 146 transitions. [2025-01-08 22:49:36,441 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:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 146 transitions. [2025-01-08 22:49:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:49:36,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:36,442 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:36,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:49:36,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:36,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash 51991941, now seen corresponding path program 1 times [2025-01-08 22:49:36,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:36,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219043969] [2025-01-08 22:49:36,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:36,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:36,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:49:36,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:49:36,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:36,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:36,494 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,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:36,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219043969] [2025-01-08 22:49:36,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219043969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:36,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:36,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:36,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35218850] [2025-01-08 22:49:36,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:36,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:36,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:36,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:36,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:36,497 INFO L87 Difference]: Start difference. First operand 79 states and 146 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:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:36,521 INFO L93 Difference]: Finished difference Result 154 states and 284 transitions. [2025-01-08 22:49:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:36,521 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:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:36,523 INFO L225 Difference]: With dead ends: 154 [2025-01-08 22:49:36,523 INFO L226 Difference]: Without dead ends: 152 [2025-01-08 22:49:36,523 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,524 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:36,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 149 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,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-08 22:49:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 106. [2025-01-08 22:49:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.8666666666666667) internal successors, (196), 105 states have internal predecessors, (196), 0 states have call successors, (0), 0 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,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 196 transitions. [2025-01-08 22:49:36,533 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 196 transitions. Word has length 20 [2025-01-08 22:49:36,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:36,534 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 196 transitions. [2025-01-08 22:49:36,534 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:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 196 transitions. [2025-01-08 22:49:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:49:36,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:36,534 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:36,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:49:36,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:36,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:36,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1227871737, now seen corresponding path program 1 times [2025-01-08 22:49:36,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:36,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013087703] [2025-01-08 22:49:36,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:36,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:36,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:49:36,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:49:36,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:36,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:36,588 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,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:36,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013087703] [2025-01-08 22:49:36,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013087703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:36,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:36,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:36,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648940310] [2025-01-08 22:49:36,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:36,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:36,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:36,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:36,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:36,590 INFO L87 Difference]: Start difference. First operand 106 states and 196 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:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:36,608 INFO L93 Difference]: Finished difference Result 258 states and 478 transitions. [2025-01-08 22:49:36,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:36,609 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:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:36,611 INFO L225 Difference]: With dead ends: 258 [2025-01-08 22:49:36,611 INFO L226 Difference]: Without dead ends: 154 [2025-01-08 22:49:36,611 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,611 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 172 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:36,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 172 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:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-08 22:49:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2025-01-08 22:49:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.8476821192052981) internal successors, (279), 151 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 279 transitions. [2025-01-08 22:49:36,622 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 279 transitions. Word has length 20 [2025-01-08 22:49:36,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:36,623 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 279 transitions. [2025-01-08 22:49:36,623 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:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 279 transitions. [2025-01-08 22:49:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:49:36,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:36,624 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:36,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:49:36,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:36,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1611963207, now seen corresponding path program 1 times [2025-01-08 22:49:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758513469] [2025-01-08 22:49:36,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:36,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:49:36,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:49:36,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:36,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:36,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:36,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758513469] [2025-01-08 22:49:36,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758513469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:36,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:36,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:36,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595526031] [2025-01-08 22:49:36,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:36,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:36,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:36,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:36,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:36,668 INFO L87 Difference]: Start difference. First operand 152 states and 279 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:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:36,684 INFO L93 Difference]: Finished difference Result 234 states and 424 transitions. [2025-01-08 22:49:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:36,684 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:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:36,685 INFO L225 Difference]: With dead ends: 234 [2025-01-08 22:49:36,685 INFO L226 Difference]: Without dead ends: 159 [2025-01-08 22:49:36,686 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,688 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 188 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:36,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 188 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:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-08 22:49:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-01-08 22:49:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.814102564102564) internal successors, (283), 156 states have internal predecessors, (283), 0 states have call successors, (0), 0 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,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 283 transitions. [2025-01-08 22:49:36,700 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 283 transitions. Word has length 21 [2025-01-08 22:49:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:36,700 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 283 transitions. [2025-01-08 22:49:36,700 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:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 283 transitions. [2025-01-08 22:49:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:49:36,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:36,701 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:36,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:49:36,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:36,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:36,702 INFO L85 PathProgramCache]: Analyzing trace with hash 590894853, now seen corresponding path program 1 times [2025-01-08 22:49:36,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:36,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423541468] [2025-01-08 22:49:36,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:36,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:36,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:49:36,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:49:36,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:36,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:36,736 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,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423541468] [2025-01-08 22:49:36,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423541468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:36,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:36,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:36,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441181034] [2025-01-08 22:49:36,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:36,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:36,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:36,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:36,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:36,741 INFO L87 Difference]: Start difference. First operand 157 states and 283 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:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:36,752 INFO L93 Difference]: Finished difference Result 297 states and 539 transitions. [2025-01-08 22:49:36,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:36,753 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:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:36,754 INFO L225 Difference]: With dead ends: 297 [2025-01-08 22:49:36,754 INFO L226 Difference]: Without dead ends: 295 [2025-01-08 22:49:36,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:36,754 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 52 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:36,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 147 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,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-08 22:49:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 213. [2025-01-08 22:49:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.7971698113207548) internal successors, (381), 212 states have internal predecessors, (381), 0 states have call successors, (0), 0 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,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 381 transitions. [2025-01-08 22:49:36,762 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 381 transitions. Word has length 21 [2025-01-08 22:49:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:36,763 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 381 transitions. [2025-01-08 22:49:36,763 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:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 381 transitions. [2025-01-08 22:49:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:49:36,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:36,763 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:36,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:49:36,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:36,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:36,764 INFO L85 PathProgramCache]: Analyzing trace with hash -688968825, now seen corresponding path program 1 times [2025-01-08 22:49:36,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:36,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723806778] [2025-01-08 22:49:36,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:36,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:36,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:49:36,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:49:36,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:36,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:36,792 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,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:36,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723806778] [2025-01-08 22:49:36,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723806778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:36,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:36,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:36,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308875251] [2025-01-08 22:49:36,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:36,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:36,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:36,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:36,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:36,793 INFO L87 Difference]: Start difference. First operand 213 states and 381 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:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:36,809 INFO L93 Difference]: Finished difference Result 509 states and 915 transitions. [2025-01-08 22:49:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:36,809 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:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:36,810 INFO L225 Difference]: With dead ends: 509 [2025-01-08 22:49:36,810 INFO L226 Difference]: Without dead ends: 303 [2025-01-08 22:49:36,810 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,811 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 173 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:36,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 173 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:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-08 22:49:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2025-01-08 22:49:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.7833333333333334) internal successors, (535), 300 states have internal predecessors, (535), 0 states have call successors, (0), 0 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,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 535 transitions. [2025-01-08 22:49:36,822 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 535 transitions. Word has length 21 [2025-01-08 22:49:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:36,822 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 535 transitions. [2025-01-08 22:49:36,822 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:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 535 transitions. [2025-01-08 22:49:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:49:36,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:36,823 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:36,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:49:36,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:36,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1138084636, now seen corresponding path program 1 times [2025-01-08 22:49:36,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:36,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168213108] [2025-01-08 22:49:36,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:36,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:49:36,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:49:36,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:36,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:36,852 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,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:36,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168213108] [2025-01-08 22:49:36,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168213108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:36,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:36,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:36,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686307679] [2025-01-08 22:49:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:36,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:36,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:36,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:36,854 INFO L87 Difference]: Start difference. First operand 301 states and 535 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:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:36,872 INFO L93 Difference]: Finished difference Result 453 states and 801 transitions. [2025-01-08 22:49:36,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:36,872 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:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:36,873 INFO L225 Difference]: With dead ends: 453 [2025-01-08 22:49:36,873 INFO L226 Difference]: Without dead ends: 307 [2025-01-08 22:49:36,874 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,875 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:36,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 184 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:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-01-08 22:49:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2025-01-08 22:49:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.7598684210526316) internal successors, (535), 304 states have internal predecessors, (535), 0 states have call successors, (0), 0 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,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 535 transitions. [2025-01-08 22:49:36,885 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 535 transitions. Word has length 22 [2025-01-08 22:49:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:36,885 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 535 transitions. [2025-01-08 22:49:36,885 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:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 535 transitions. [2025-01-08 22:49:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:49:36,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:36,886 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:36,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:49:36,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:36,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash 117016282, now seen corresponding path program 1 times [2025-01-08 22:49:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:36,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014132207] [2025-01-08 22:49:36,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:36,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:49:36,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:49:36,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:36,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:36,916 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,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:36,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014132207] [2025-01-08 22:49:36,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014132207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:36,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:36,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039359398] [2025-01-08 22:49:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:36,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:36,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:36,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:36,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:36,917 INFO L87 Difference]: Start difference. First operand 305 states and 535 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:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:36,930 INFO L93 Difference]: Finished difference Result 569 states and 1009 transitions. [2025-01-08 22:49:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:36,931 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:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:36,932 INFO L225 Difference]: With dead ends: 569 [2025-01-08 22:49:36,932 INFO L226 Difference]: Without dead ends: 567 [2025-01-08 22:49:36,933 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,933 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:36,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 145 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,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-08 22:49:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 421. [2025-01-08 22:49:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.730952380952381) internal successors, (727), 420 states have internal predecessors, (727), 0 states have call successors, (0), 0 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,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 727 transitions. [2025-01-08 22:49:36,943 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 727 transitions. Word has length 22 [2025-01-08 22:49:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:36,943 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 727 transitions. [2025-01-08 22:49:36,943 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:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 727 transitions. [2025-01-08 22:49:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:49:36,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:36,944 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:36,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:49:36,944 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:36,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1162847396, now seen corresponding path program 1 times [2025-01-08 22:49:36,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:36,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844682623] [2025-01-08 22:49:36,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:36,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:49:36,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:49:36,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:36,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:36,970 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,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:36,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844682623] [2025-01-08 22:49:36,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844682623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:36,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:36,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:36,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456087000] [2025-01-08 22:49:36,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:36,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:36,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:36,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:36,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:36,971 INFO L87 Difference]: Start difference. First operand 421 states and 727 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:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:36,988 INFO L93 Difference]: Finished difference Result 1001 states and 1737 transitions. [2025-01-08 22:49:36,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:36,988 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:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:36,990 INFO L225 Difference]: With dead ends: 1001 [2025-01-08 22:49:36,990 INFO L226 Difference]: Without dead ends: 591 [2025-01-08 22:49:36,990 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,991 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 174 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:36,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 174 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:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-08 22:49:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2025-01-08 22:49:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.719387755102041) internal successors, (1011), 588 states have internal predecessors, (1011), 0 states have call successors, (0), 0 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,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1011 transitions. [2025-01-08 22:49:37,012 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1011 transitions. Word has length 22 [2025-01-08 22:49:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:37,013 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 1011 transitions. [2025-01-08 22:49:37,013 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:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1011 transitions. [2025-01-08 22:49:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 22:49:37,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:37,014 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:37,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:49:37,014 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:37,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash -667248836, now seen corresponding path program 1 times [2025-01-08 22:49:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026324952] [2025-01-08 22:49:37,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:37,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 22:49:37,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 22:49:37,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:37,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:37,037 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:37,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026324952] [2025-01-08 22:49:37,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026324952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:37,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:37,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:37,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134192951] [2025-01-08 22:49:37,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:37,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:37,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:37,038 INFO L87 Difference]: Start difference. First operand 589 states and 1011 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:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:37,058 INFO L93 Difference]: Finished difference Result 885 states and 1513 transitions. [2025-01-08 22:49:37,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:37,058 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:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:37,060 INFO L225 Difference]: With dead ends: 885 [2025-01-08 22:49:37,060 INFO L226 Difference]: Without dead ends: 599 [2025-01-08 22:49:37,060 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,061 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:37,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 180 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:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-01-08 22:49:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2025-01-08 22:49:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.6963087248322148) internal successors, (1011), 596 states have internal predecessors, (1011), 0 states have call successors, (0), 0 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,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1011 transitions. [2025-01-08 22:49:37,076 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1011 transitions. Word has length 23 [2025-01-08 22:49:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:37,076 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 1011 transitions. [2025-01-08 22:49:37,076 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:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1011 transitions. [2025-01-08 22:49:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 22:49:37,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:37,076 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:37,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:49:37,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:37,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1688317190, now seen corresponding path program 1 times [2025-01-08 22:49:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:37,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237998813] [2025-01-08 22:49:37,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:37,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 22:49:37,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 22:49:37,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:37,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:37,099 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:37,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237998813] [2025-01-08 22:49:37,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237998813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:37,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:37,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:37,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003626881] [2025-01-08 22:49:37,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:37,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:37,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:37,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:37,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:37,100 INFO L87 Difference]: Start difference. First operand 597 states and 1011 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:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:37,121 INFO L93 Difference]: Finished difference Result 1097 states and 1885 transitions. [2025-01-08 22:49:37,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:37,121 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:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:37,124 INFO L225 Difference]: With dead ends: 1097 [2025-01-08 22:49:37,124 INFO L226 Difference]: Without dead ends: 1095 [2025-01-08 22:49:37,125 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,125 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:37,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 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:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-01-08 22:49:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2025-01-08 22:49:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.6590909090909092) internal successors, (1387), 836 states have internal predecessors, (1387), 0 states have call successors, (0), 0 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,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1387 transitions. [2025-01-08 22:49:37,143 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1387 transitions. Word has length 23 [2025-01-08 22:49:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:37,144 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1387 transitions. [2025-01-08 22:49:37,144 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:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1387 transitions. [2025-01-08 22:49:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 22:49:37,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:37,145 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:37,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:49:37,145 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:37,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1326786428, now seen corresponding path program 1 times [2025-01-08 22:49:37,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:37,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712830896] [2025-01-08 22:49:37,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:37,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:37,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 22:49:37,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 22:49:37,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:37,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:37,167 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:37,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:37,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712830896] [2025-01-08 22:49:37,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712830896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:37,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:37,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:37,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690543867] [2025-01-08 22:49:37,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:37,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:37,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:37,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:37,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:37,168 INFO L87 Difference]: Start difference. First operand 837 states and 1387 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:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:37,191 INFO L93 Difference]: Finished difference Result 1977 states and 3293 transitions. [2025-01-08 22:49:37,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:37,191 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:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:37,195 INFO L225 Difference]: With dead ends: 1977 [2025-01-08 22:49:37,195 INFO L226 Difference]: Without dead ends: 1159 [2025-01-08 22:49:37,196 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,197 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 175 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,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 175 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,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-01-08 22:49:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2025-01-08 22:49:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.6496539792387543) internal successors, (1907), 1156 states have internal predecessors, (1907), 0 states have call successors, (0), 0 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,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1907 transitions. [2025-01-08 22:49:37,221 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1907 transitions. Word has length 23 [2025-01-08 22:49:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:37,221 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1907 transitions. [2025-01-08 22:49:37,221 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:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1907 transitions. [2025-01-08 22:49:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:37,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:37,234 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:37,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:49:37,234 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:37,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:37,234 INFO L85 PathProgramCache]: Analyzing trace with hash -798011279, now seen corresponding path program 1 times [2025-01-08 22:49:37,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:37,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102390387] [2025-01-08 22:49:37,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:37,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:37,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:37,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:37,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:37,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:37,253 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:37,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:37,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102390387] [2025-01-08 22:49:37,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102390387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:37,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:37,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:37,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870615342] [2025-01-08 22:49:37,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:37,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:37,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:37,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:37,254 INFO L87 Difference]: Start difference. First operand 1157 states and 1907 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:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:37,277 INFO L93 Difference]: Finished difference Result 1737 states and 2853 transitions. [2025-01-08 22:49:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:37,278 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:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:37,281 INFO L225 Difference]: With dead ends: 1737 [2025-01-08 22:49:37,281 INFO L226 Difference]: Without dead ends: 1175 [2025-01-08 22:49:37,282 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,284 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:37,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 176 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:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-01-08 22:49:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2025-01-08 22:49:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1172 states have internal predecessors, (1907), 0 states have call successors, (0), 0 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,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1907 transitions. [2025-01-08 22:49:37,315 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1907 transitions. Word has length 24 [2025-01-08 22:49:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:37,315 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1907 transitions. [2025-01-08 22:49:37,315 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:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1907 transitions. [2025-01-08 22:49:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:37,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:37,316 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:37,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:49:37,317 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:37,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1819079633, now seen corresponding path program 1 times [2025-01-08 22:49:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:37,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803758862] [2025-01-08 22:49:37,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:37,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:37,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:37,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:37,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:37,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:37,336 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:37,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:37,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803758862] [2025-01-08 22:49:37,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803758862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:37,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:37,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:37,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980135884] [2025-01-08 22:49:37,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:37,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:37,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:37,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:37,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:37,337 INFO L87 Difference]: Start difference. First operand 1173 states and 1907 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:37,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:37,373 INFO L93 Difference]: Finished difference Result 2121 states and 3509 transitions. [2025-01-08 22:49:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:37,375 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:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:37,381 INFO L225 Difference]: With dead ends: 2121 [2025-01-08 22:49:37,381 INFO L226 Difference]: Without dead ends: 2119 [2025-01-08 22:49:37,383 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,383 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:37,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 141 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:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2025-01-08 22:49:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1669. [2025-01-08 22:49:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.5845323741007193) internal successors, (2643), 1668 states have internal predecessors, (2643), 0 states have call successors, (0), 0 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,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2643 transitions. [2025-01-08 22:49:37,416 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2643 transitions. Word has length 24 [2025-01-08 22:49:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:37,416 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2643 transitions. [2025-01-08 22:49:37,416 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:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2643 transitions. [2025-01-08 22:49:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:37,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:37,418 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:37,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:49:37,418 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:37,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1196023985, now seen corresponding path program 1 times [2025-01-08 22:49:37,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:37,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728828268] [2025-01-08 22:49:37,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:37,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:37,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:37,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:37,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:37,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:37,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728828268] [2025-01-08 22:49:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728828268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:37,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638077743] [2025-01-08 22:49:37,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:37,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:37,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:37,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:37,440 INFO L87 Difference]: Start difference. First operand 1669 states and 2643 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:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:37,489 INFO L93 Difference]: Finished difference Result 3913 states and 6229 transitions. [2025-01-08 22:49:37,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:37,489 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:37,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:37,494 INFO L225 Difference]: With dead ends: 3913 [2025-01-08 22:49:37,494 INFO L226 Difference]: Without dead ends: 2279 [2025-01-08 22:49:37,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:37,496 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 176 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,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 176 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,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2025-01-08 22:49:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2277. [2025-01-08 22:49:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 1.5760105448154658) internal successors, (3587), 2276 states have internal predecessors, (3587), 0 states have call successors, (0), 0 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,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3587 transitions. [2025-01-08 22:49:37,541 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3587 transitions. Word has length 24 [2025-01-08 22:49:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:37,542 INFO L471 AbstractCegarLoop]: Abstraction has 2277 states and 3587 transitions. [2025-01-08 22:49:37,542 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:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3587 transitions. [2025-01-08 22:49:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:37,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:37,543 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:37,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:49:37,543 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:37,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash -556679375, now seen corresponding path program 1 times [2025-01-08 22:49:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:37,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831327369] [2025-01-08 22:49:37,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:37,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:37,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:37,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:37,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:37,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:37,563 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:37,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:37,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831327369] [2025-01-08 22:49:37,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831327369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:37,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:37,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4485315] [2025-01-08 22:49:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:37,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:37,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:37,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:37,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:37,564 INFO L87 Difference]: Start difference. First operand 2277 states and 3587 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:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:37,599 INFO L93 Difference]: Finished difference Result 3417 states and 5365 transitions. [2025-01-08 22:49:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:37,599 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:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:37,605 INFO L225 Difference]: With dead ends: 3417 [2025-01-08 22:49:37,605 INFO L226 Difference]: Without dead ends: 2311 [2025-01-08 22:49:37,606 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,606 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 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:37,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 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:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2025-01-08 22:49:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2025-01-08 22:49:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.5541594454072791) internal successors, (3587), 2308 states have internal predecessors, (3587), 0 states have call successors, (0), 0 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,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3587 transitions. [2025-01-08 22:49:37,670 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3587 transitions. Word has length 25 [2025-01-08 22:49:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:37,670 INFO L471 AbstractCegarLoop]: Abstraction has 2309 states and 3587 transitions. [2025-01-08 22:49:37,670 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:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3587 transitions. [2025-01-08 22:49:37,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:37,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:37,672 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:37,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:49:37,673 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:37,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:37,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1577747729, now seen corresponding path program 1 times [2025-01-08 22:49:37,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:37,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242048151] [2025-01-08 22:49:37,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:37,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:37,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:37,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:37,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:37,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:37,694 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:37,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:37,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242048151] [2025-01-08 22:49:37,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242048151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:37,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35265182] [2025-01-08 22:49:37,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:37,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:37,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:37,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:37,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:37,695 INFO L87 Difference]: Start difference. First operand 2309 states and 3587 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:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:37,748 INFO L93 Difference]: Finished difference Result 4105 states and 6501 transitions. [2025-01-08 22:49:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:37,748 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:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:37,758 INFO L225 Difference]: With dead ends: 4105 [2025-01-08 22:49:37,758 INFO L226 Difference]: Without dead ends: 4103 [2025-01-08 22:49:37,759 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,760 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 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:37,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 139 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:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2025-01-08 22:49:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3333. [2025-01-08 22:49:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.508703481392557) internal successors, (5027), 3332 states have internal predecessors, (5027), 0 states have call successors, (0), 0 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,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 5027 transitions. [2025-01-08 22:49:37,836 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 5027 transitions. Word has length 25 [2025-01-08 22:49:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:37,836 INFO L471 AbstractCegarLoop]: Abstraction has 3333 states and 5027 transitions. [2025-01-08 22:49:37,837 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:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 5027 transitions. [2025-01-08 22:49:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:37,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:37,840 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:37,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:49:37,840 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:37,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:37,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1437355889, now seen corresponding path program 1 times [2025-01-08 22:49:37,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:37,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61501919] [2025-01-08 22:49:37,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:37,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:37,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:37,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:37,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:37,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:37,856 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:37,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61501919] [2025-01-08 22:49:37,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61501919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:37,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:37,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:37,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730622643] [2025-01-08 22:49:37,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:37,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:37,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:37,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:37,858 INFO L87 Difference]: Start difference. First operand 3333 states and 5027 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:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:37,934 INFO L93 Difference]: Finished difference Result 7753 states and 11749 transitions. [2025-01-08 22:49:37,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:37,934 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:37,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:37,945 INFO L225 Difference]: With dead ends: 7753 [2025-01-08 22:49:37,946 INFO L226 Difference]: Without dead ends: 4487 [2025-01-08 22:49:37,949 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,949 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 177 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,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 177 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,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2025-01-08 22:49:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2025-01-08 22:49:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4484 states have (on average 1.4993309545049063) internal successors, (6723), 4484 states have internal predecessors, (6723), 0 states have call successors, (0), 0 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:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6723 transitions. [2025-01-08 22:49:38,065 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6723 transitions. Word has length 25 [2025-01-08 22:49:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:38,065 INFO L471 AbstractCegarLoop]: Abstraction has 4485 states and 6723 transitions. [2025-01-08 22:49:38,066 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:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6723 transitions. [2025-01-08 22:49:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:38,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:38,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:38,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 22:49:38,068 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:38,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1665324602, now seen corresponding path program 1 times [2025-01-08 22:49:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:38,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120032283] [2025-01-08 22:49:38,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:38,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:38,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:38,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:38,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:38,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:38,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:38,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120032283] [2025-01-08 22:49:38,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120032283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:38,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:38,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:38,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497627985] [2025-01-08 22:49:38,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:38,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:38,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:38,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:38,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:38,084 INFO L87 Difference]: Start difference. First operand 4485 states and 6723 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:38,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:38,135 INFO L93 Difference]: Finished difference Result 6729 states and 10053 transitions. [2025-01-08 22:49:38,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:38,136 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:38,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:38,150 INFO L225 Difference]: With dead ends: 6729 [2025-01-08 22:49:38,152 INFO L226 Difference]: Without dead ends: 4551 [2025-01-08 22:49:38,155 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:38,155 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 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:38,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 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:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2025-01-08 22:49:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4549. [2025-01-08 22:49:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4549 states, 4548 states have (on average 1.4782321899736148) internal successors, (6723), 4548 states have internal predecessors, (6723), 0 states have call successors, (0), 0 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:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6723 transitions. [2025-01-08 22:49:38,265 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6723 transitions. Word has length 26 [2025-01-08 22:49:38,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:38,266 INFO L471 AbstractCegarLoop]: Abstraction has 4549 states and 6723 transitions. [2025-01-08 22:49:38,266 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:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6723 transitions. [2025-01-08 22:49:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:38,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:38,268 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:38,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 22:49:38,268 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:38,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1608574340, now seen corresponding path program 1 times [2025-01-08 22:49:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:38,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416051863] [2025-01-08 22:49:38,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:38,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:38,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:38,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:38,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:38,284 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:38,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:38,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416051863] [2025-01-08 22:49:38,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416051863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:38,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:38,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11023614] [2025-01-08 22:49:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:38,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:38,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:38,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:38,286 INFO L87 Difference]: Start difference. First operand 4549 states and 6723 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:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:38,358 INFO L93 Difference]: Finished difference Result 7945 states and 11973 transitions. [2025-01-08 22:49:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:38,359 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:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:38,370 INFO L225 Difference]: With dead ends: 7945 [2025-01-08 22:49:38,370 INFO L226 Difference]: Without dead ends: 7943 [2025-01-08 22:49:38,372 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:38,373 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 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:38,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 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:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2025-01-08 22:49:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 6661. [2025-01-08 22:49:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.4322822822822823) internal successors, (9539), 6660 states have internal predecessors, (9539), 0 states have call successors, (0), 0 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:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 9539 transitions. [2025-01-08 22:49:38,494 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 9539 transitions. Word has length 26 [2025-01-08 22:49:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:38,494 INFO L471 AbstractCegarLoop]: Abstraction has 6661 states and 9539 transitions. [2025-01-08 22:49:38,494 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:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 9539 transitions. [2025-01-08 22:49:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:38,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:38,499 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:38,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:49:38,499 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:38,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:38,499 INFO L85 PathProgramCache]: Analyzing trace with hash 328710662, now seen corresponding path program 1 times [2025-01-08 22:49:38,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:38,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261749671] [2025-01-08 22:49:38,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:38,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:38,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:38,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:38,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:38,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:38,513 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:38,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:38,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261749671] [2025-01-08 22:49:38,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261749671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:38,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:38,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:38,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994747217] [2025-01-08 22:49:38,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:38,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:38,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:38,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:38,514 INFO L87 Difference]: Start difference. First operand 6661 states and 9539 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:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:38,645 INFO L93 Difference]: Finished difference Result 15369 states and 22085 transitions. [2025-01-08 22:49:38,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:38,645 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:38,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:38,657 INFO L225 Difference]: With dead ends: 15369 [2025-01-08 22:49:38,658 INFO L226 Difference]: Without dead ends: 8839 [2025-01-08 22:49:38,663 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:38,665 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 178 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:38,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 178 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:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2025-01-08 22:49:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8837. [2025-01-08 22:49:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8837 states, 8836 states have (on average 1.4199864191942055) internal successors, (12547), 8836 states have internal predecessors, (12547), 0 states have call successors, (0), 0 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:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12547 transitions. [2025-01-08 22:49:38,895 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12547 transitions. Word has length 26 [2025-01-08 22:49:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:38,895 INFO L471 AbstractCegarLoop]: Abstraction has 8837 states and 12547 transitions. [2025-01-08 22:49:38,895 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:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12547 transitions. [2025-01-08 22:49:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:49:38,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:38,902 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:38,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 22:49:38,902 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:38,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1673587930, now seen corresponding path program 1 times [2025-01-08 22:49:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984807433] [2025-01-08 22:49:38,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:38,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:49:38,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:49:38,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:38,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:38,927 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:38,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:38,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984807433] [2025-01-08 22:49:38,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984807433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:38,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348234806] [2025-01-08 22:49:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:38,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:38,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:38,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:38,929 INFO L87 Difference]: Start difference. First operand 8837 states and 12547 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:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:39,037 INFO L93 Difference]: Finished difference Result 13257 states and 18757 transitions. [2025-01-08 22:49:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:39,038 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:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:39,050 INFO L225 Difference]: With dead ends: 13257 [2025-01-08 22:49:39,050 INFO L226 Difference]: Without dead ends: 8967 [2025-01-08 22:49:39,055 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:39,055 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 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:39,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 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:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8967 states. [2025-01-08 22:49:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8967 to 8965. [2025-01-08 22:49:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8965 states, 8964 states have (on average 1.3997099509147701) internal successors, (12547), 8964 states have internal predecessors, (12547), 0 states have call successors, (0), 0 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:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 12547 transitions. [2025-01-08 22:49:39,215 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 12547 transitions. Word has length 27 [2025-01-08 22:49:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:39,215 INFO L471 AbstractCegarLoop]: Abstraction has 8965 states and 12547 transitions. [2025-01-08 22:49:39,216 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:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 12547 transitions. [2025-01-08 22:49:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:49:39,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:39,221 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:39,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 22:49:39,221 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:39,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1600311012, now seen corresponding path program 1 times [2025-01-08 22:49:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:39,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578157382] [2025-01-08 22:49:39,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:39,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:39,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:49:39,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:49:39,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:39,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:39,238 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:39,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:39,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578157382] [2025-01-08 22:49:39,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578157382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:39,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:39,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:39,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847511481] [2025-01-08 22:49:39,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:39,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:39,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:39,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:39,239 INFO L87 Difference]: Start difference. First operand 8965 states and 12547 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:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:39,373 INFO L93 Difference]: Finished difference Result 26121 states and 36101 transitions. [2025-01-08 22:49:39,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:39,373 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:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:39,397 INFO L225 Difference]: With dead ends: 26121 [2025-01-08 22:49:39,397 INFO L226 Difference]: Without dead ends: 17415 [2025-01-08 22:49:39,406 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:39,407 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:39,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 151 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:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2025-01-08 22:49:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 17413. [2025-01-08 22:49:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17413 states, 17412 states have (on average 1.3528026648288536) internal successors, (23555), 17412 states have internal predecessors, (23555), 0 states have call successors, (0), 0 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:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 23555 transitions. [2025-01-08 22:49:39,691 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 23555 transitions. Word has length 27 [2025-01-08 22:49:39,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:39,691 INFO L471 AbstractCegarLoop]: Abstraction has 17413 states and 23555 transitions. [2025-01-08 22:49:39,692 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:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 23555 transitions. [2025-01-08 22:49:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:49:39,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:39,701 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:39,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-08 22:49:39,701 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:39,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1414792606, now seen corresponding path program 1 times [2025-01-08 22:49:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:39,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399878963] [2025-01-08 22:49:39,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:39,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:39,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:49:39,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:49:39,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:39,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:39,715 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:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399878963] [2025-01-08 22:49:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399878963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842773125] [2025-01-08 22:49:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:39,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:39,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:39,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:39,716 INFO L87 Difference]: Start difference. First operand 17413 states and 23555 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:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:39,977 INFO L93 Difference]: Finished difference Result 19465 states and 27141 transitions. [2025-01-08 22:49:39,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:39,978 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:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:40,008 INFO L225 Difference]: With dead ends: 19465 [2025-01-08 22:49:40,009 INFO L226 Difference]: Without dead ends: 19463 [2025-01-08 22:49:40,015 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:40,016 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 34 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 176 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:40,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 176 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:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19463 states. [2025-01-08 22:49:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19463 to 17413. [2025-01-08 22:49:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17413 states, 17412 states have (on average 1.3381001608086378) internal successors, (23299), 17412 states have internal predecessors, (23299), 0 states have call successors, (0), 0 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:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 23299 transitions. [2025-01-08 22:49:40,382 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 23299 transitions. Word has length 27 [2025-01-08 22:49:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:40,382 INFO L471 AbstractCegarLoop]: Abstraction has 17413 states and 23299 transitions. [2025-01-08 22:49:40,382 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:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 23299 transitions. [2025-01-08 22:49:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:49:40,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:40,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:40,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-08 22:49:40,393 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:40,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1929750757, now seen corresponding path program 1 times [2025-01-08 22:49:40,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:40,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818810764] [2025-01-08 22:49:40,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:40,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:40,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:49:40,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:49:40,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:40,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:40,407 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:40,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:40,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818810764] [2025-01-08 22:49:40,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818810764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:40,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:40,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:40,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433762154] [2025-01-08 22:49:40,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:40,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:40,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:40,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:40,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:40,409 INFO L87 Difference]: Start difference. First operand 17413 states and 23299 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:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:40,591 INFO L93 Difference]: Finished difference Result 29449 states and 39941 transitions. [2025-01-08 22:49:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:40,592 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:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:40,687 INFO L225 Difference]: With dead ends: 29449 [2025-01-08 22:49:40,687 INFO L226 Difference]: Without dead ends: 29447 [2025-01-08 22:49:40,690 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:40,691 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 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:40,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 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:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29447 states. [2025-01-08 22:49:40,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29447 to 26373. [2025-01-08 22:49:40,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26373 states, 26372 states have (on average 1.3008873047171243) internal successors, (34307), 26372 states have internal predecessors, (34307), 0 states have call successors, (0), 0 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:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26373 states to 26373 states and 34307 transitions. [2025-01-08 22:49:40,996 INFO L78 Accepts]: Start accepts. Automaton has 26373 states and 34307 transitions. Word has length 28 [2025-01-08 22:49:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:40,996 INFO L471 AbstractCegarLoop]: Abstraction has 26373 states and 34307 transitions. [2025-01-08 22:49:40,996 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:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 26373 states and 34307 transitions. [2025-01-08 22:49:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:49:41,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:41,014 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:41,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-08 22:49:41,015 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:41,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1085352861, now seen corresponding path program 1 times [2025-01-08 22:49:41,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:41,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267241065] [2025-01-08 22:49:41,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:41,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:41,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:49:41,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:49:41,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:41,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:41,031 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:41,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267241065] [2025-01-08 22:49:41,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267241065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:41,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:41,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:41,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177825042] [2025-01-08 22:49:41,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:41,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:41,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:41,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:41,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:41,032 INFO L87 Difference]: Start difference. First operand 26373 states and 34307 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:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:41,315 INFO L93 Difference]: Finished difference Result 60169 states and 78341 transitions. [2025-01-08 22:49:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:41,315 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:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:41,363 INFO L225 Difference]: With dead ends: 60169 [2025-01-08 22:49:41,363 INFO L226 Difference]: Without dead ends: 34055 [2025-01-08 22:49:41,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:41,384 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 180 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.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:41,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:49:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34055 states. [2025-01-08 22:49:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34055 to 34053. [2025-01-08 22:49:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34053 states, 34052 states have (on average 1.2781334429695759) internal successors, (43523), 34052 states have internal predecessors, (43523), 0 states have call successors, (0), 0 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:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34053 states to 34053 states and 43523 transitions. [2025-01-08 22:49:42,086 INFO L78 Accepts]: Start accepts. Automaton has 34053 states and 43523 transitions. Word has length 28 [2025-01-08 22:49:42,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:42,086 INFO L471 AbstractCegarLoop]: Abstraction has 34053 states and 43523 transitions. [2025-01-08 22:49:42,086 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:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 34053 states and 43523 transitions. [2025-01-08 22:49:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:49:42,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:42,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:42,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-08 22:49:42,105 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:42,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:42,106 INFO L85 PathProgramCache]: Analyzing trace with hash 307484441, now seen corresponding path program 1 times [2025-01-08 22:49:42,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:42,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860479042] [2025-01-08 22:49:42,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:42,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:42,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:49:42,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:49:42,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:42,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:42,123 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:42,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:42,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860479042] [2025-01-08 22:49:42,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860479042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:42,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:42,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:42,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972576939] [2025-01-08 22:49:42,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:42,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:42,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:42,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:42,124 INFO L87 Difference]: Start difference. First operand 34053 states and 43523 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:42,543 INFO L93 Difference]: Finished difference Result 51465 states and 65797 transitions. [2025-01-08 22:49:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:42,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-08 22:49:42,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:42,577 INFO L225 Difference]: With dead ends: 51465 [2025-01-08 22:49:42,578 INFO L226 Difference]: Without dead ends: 34823 [2025-01-08 22:49:42,587 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:42,588 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 51 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 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:42,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 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:42,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34823 states. [2025-01-08 22:49:42,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34823 to 34821. [2025-01-08 22:49:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34821 states, 34820 states have (on average 1.264646754738656) internal successors, (44035), 34820 states have internal predecessors, (44035), 0 states have call successors, (0), 0 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:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 44035 transitions. [2025-01-08 22:49:43,015 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 44035 transitions. Word has length 29 [2025-01-08 22:49:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:43,015 INFO L471 AbstractCegarLoop]: Abstraction has 34821 states and 44035 transitions. [2025-01-08 22:49:43,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 44035 transitions. [2025-01-08 22:49:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:49:43,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:43,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:43,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-08 22:49:43,031 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:43,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash -713583913, now seen corresponding path program 1 times [2025-01-08 22:49:43,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:43,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095813900] [2025-01-08 22:49:43,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:43,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:43,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:49:43,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:49:43,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:43,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:43,050 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:43,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:43,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095813900] [2025-01-08 22:49:43,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095813900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:43,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:43,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:43,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604451004] [2025-01-08 22:49:43,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:43,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:43,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:43,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:43,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:43,051 INFO L87 Difference]: Start difference. First operand 34821 states and 44035 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:43,489 INFO L93 Difference]: Finished difference Result 57353 states and 72709 transitions. [2025-01-08 22:49:43,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:43,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-08 22:49:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:43,541 INFO L225 Difference]: With dead ends: 57353 [2025-01-08 22:49:43,542 INFO L226 Difference]: Without dead ends: 57351 [2025-01-08 22:49:43,551 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:43,555 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 28 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 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:43,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 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:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57351 states. [2025-01-08 22:49:44,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57351 to 53253. [2025-01-08 22:49:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53253 states, 53252 states have (on average 1.2307331180049577) internal successors, (65539), 53252 states have internal predecessors, (65539), 0 states have call successors, (0), 0 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:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53253 states to 53253 states and 65539 transitions. [2025-01-08 22:49:44,189 INFO L78 Accepts]: Start accepts. Automaton has 53253 states and 65539 transitions. Word has length 29 [2025-01-08 22:49:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:44,189 INFO L471 AbstractCegarLoop]: Abstraction has 53253 states and 65539 transitions. [2025-01-08 22:49:44,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 53253 states and 65539 transitions. [2025-01-08 22:49:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:49:44,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:44,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:44,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-08 22:49:44,214 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:44,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1993447591, now seen corresponding path program 1 times [2025-01-08 22:49:44,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:44,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673914995] [2025-01-08 22:49:44,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:44,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:44,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:49:44,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:49:44,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:44,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:44,234 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:44,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:44,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673914995] [2025-01-08 22:49:44,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673914995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:44,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:44,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:44,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976882609] [2025-01-08 22:49:44,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:44,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:44,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:44,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:44,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:44,236 INFO L87 Difference]: Start difference. First operand 53253 states and 65539 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:44,978 INFO L93 Difference]: Finished difference Result 119817 states and 146437 transitions. [2025-01-08 22:49:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:44,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-08 22:49:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:45,041 INFO L225 Difference]: With dead ends: 119817 [2025-01-08 22:49:45,041 INFO L226 Difference]: Without dead ends: 67591 [2025-01-08 22:49:45,073 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:45,074 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 181 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:45,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 181 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:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67591 states. [2025-01-08 22:49:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67591 to 67589. [2025-01-08 22:49:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67589 states, 67588 states have (on average 1.1969432443629047) internal successors, (80899), 67588 states have internal predecessors, (80899), 0 states have call successors, (0), 0 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:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 80899 transitions. [2025-01-08 22:49:46,401 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 80899 transitions. Word has length 29 [2025-01-08 22:49:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:46,401 INFO L471 AbstractCegarLoop]: Abstraction has 67589 states and 80899 transitions. [2025-01-08 22:49:46,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 80899 transitions. [2025-01-08 22:49:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:49:46,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:46,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, 1, 1, 1] [2025-01-08 22:49:46,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-08 22:49:46,428 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:46,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash -646048718, now seen corresponding path program 1 times [2025-01-08 22:49:46,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:46,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86321855] [2025-01-08 22:49:46,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:46,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:49:46,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:49:46,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:46,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:46,441 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:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:46,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86321855] [2025-01-08 22:49:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86321855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:46,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:46,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997761521] [2025-01-08 22:49:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:46,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:46,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:46,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:46,443 INFO L87 Difference]: Start difference. First operand 67589 states and 80899 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:47,038 INFO L93 Difference]: Finished difference Result 101385 states and 120837 transitions. [2025-01-08 22:49:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:47,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-08 22:49:47,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:47,097 INFO L225 Difference]: With dead ends: 101385 [2025-01-08 22:49:47,097 INFO L226 Difference]: Without dead ends: 68615 [2025-01-08 22:49:47,120 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:47,121 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 50 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 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:47,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 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:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68615 states. [2025-01-08 22:49:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68615 to 68613. [2025-01-08 22:49:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68613 states, 68612 states have (on average 1.1790794613187197) internal successors, (80899), 68612 states have internal predecessors, (80899), 0 states have call successors, (0), 0 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:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68613 states to 68613 states and 80899 transitions. [2025-01-08 22:49:48,107 INFO L78 Accepts]: Start accepts. Automaton has 68613 states and 80899 transitions. Word has length 30 [2025-01-08 22:49:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:48,107 INFO L471 AbstractCegarLoop]: Abstraction has 68613 states and 80899 transitions. [2025-01-08 22:49:48,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 68613 states and 80899 transitions. [2025-01-08 22:49:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:49:48,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:48,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:48,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-08 22:49:48,128 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:48,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1667117072, now seen corresponding path program 1 times [2025-01-08 22:49:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:48,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80853896] [2025-01-08 22:49:48,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:48,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:49:48,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:49:48,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:48,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:48,143 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:48,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:48,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80853896] [2025-01-08 22:49:48,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80853896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:48,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:48,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:48,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600232591] [2025-01-08 22:49:48,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:48,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:48,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:48,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:48,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:48,145 INFO L87 Difference]: Start difference. First operand 68613 states and 80899 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:49,472 INFO L93 Difference]: Finished difference Result 110599 states and 129028 transitions. [2025-01-08 22:49:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:49,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-08 22:49:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:49,567 INFO L225 Difference]: With dead ends: 110599 [2025-01-08 22:49:49,567 INFO L226 Difference]: Without dead ends: 110597 [2025-01-08 22:49:49,584 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:49,585 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 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:49,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 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:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110597 states. [2025-01-08 22:49:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110597 to 106501. [2025-01-08 22:49:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106501 states, 106500 states have (on average 1.153830985915493) internal successors, (122883), 106500 states have internal predecessors, (122883), 0 states have call successors, (0), 0 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:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106501 states to 106501 states and 122883 transitions. [2025-01-08 22:49:51,114 INFO L78 Accepts]: Start accepts. Automaton has 106501 states and 122883 transitions. Word has length 30 [2025-01-08 22:49:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:51,114 INFO L471 AbstractCegarLoop]: Abstraction has 106501 states and 122883 transitions. [2025-01-08 22:49:51,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 106501 states and 122883 transitions. [2025-01-08 22:49:51,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:49:51,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:51,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:49:51,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-08 22:49:51,157 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:51,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:51,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1347986546, now seen corresponding path program 1 times [2025-01-08 22:49:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:51,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763365240] [2025-01-08 22:49:51,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:51,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:51,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:49:51,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:49:51,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:51,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:51,171 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:51,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:51,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763365240] [2025-01-08 22:49:51,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763365240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:51,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:51,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:51,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655234827] [2025-01-08 22:49:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:51,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:51,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:51,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:51,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:51,172 INFO L87 Difference]: Start difference. First operand 106501 states and 122883 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:52,723 INFO L93 Difference]: Finished difference Result 237573 states and 270339 transitions. [2025-01-08 22:49:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:52,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-08 22:49:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:52,728 INFO L225 Difference]: With dead ends: 237573 [2025-01-08 22:49:52,728 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:49:52,786 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:52,787 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 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:52,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 180 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:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:49:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:49:52,787 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:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:49:52,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2025-01-08 22:49:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:52,790 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:49:52,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:49:52,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:49:52,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:49:52,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-08 22:49:52,795 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, 1, 1, 1] [2025-01-08 22:49:52,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:49:52,810 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:49:52,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:49:52 BoogieIcfgContainer [2025-01-08 22:49:52,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:49:52,817 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:49:52,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:49:52,818 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:49:52,818 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:35" (3/4) ... [2025-01-08 22:49:52,820 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:49:52,827 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-08 22:49:52,828 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:49:52,828 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:49:52,828 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:49:52,882 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:49:52,882 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:49:52,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:49:52,883 INFO L158 Benchmark]: Toolchain (without parser) took 17389.52ms. Allocated memory was 142.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 113.2MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-01-08 22:49:52,883 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:49:52,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.90ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 100.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:49:52,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.53ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:49:52,884 INFO L158 Benchmark]: Boogie Preprocessor took 38.44ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:49:52,885 INFO L158 Benchmark]: RCFGBuilder took 261.47ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 81.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:49:52,885 INFO L158 Benchmark]: TraceAbstraction took 16822.07ms. Allocated memory was 142.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 81.1MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-01-08 22:49:52,885 INFO L158 Benchmark]: Witness Printer took 64.67ms. Allocated memory is still 5.7GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:49:52,886 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.17ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.90ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 100.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.53ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.44ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 261.47ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 81.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16822.07ms. Allocated memory was 142.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 81.1MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 64.67ms. Allocated memory is still 5.7GB. Free memory was 3.8GB in the beginning and 3.8GB 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: 191]: 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, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1623 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1623 mSDsluCounter, 5403 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2169 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 3234 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106501occurred in iteration=32, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 1706 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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:52,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE