./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:07:55,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:07:55,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:07:55,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:07:55,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:07:55,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:07:55,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:07:55,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:07:55,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:07:55,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:07:55,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:07:55,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:07:55,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:07:55,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:07:55,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:07:55,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:07:55,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:07:55,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:07:55,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:07:55,683 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 [2025-03-16 19:07:55,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:07:55,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:07:55,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:07:55,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:07:55,899 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:07:55,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2025-03-16 19:07:57,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634edfe47/37194e3ebb06489587f134c0f9257c8e/FLAG51da9d99f [2025-03-16 19:07:57,262 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:07:57,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2025-03-16 19:07:57,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634edfe47/37194e3ebb06489587f134c0f9257c8e/FLAG51da9d99f [2025-03-16 19:07:57,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634edfe47/37194e3ebb06489587f134c0f9257c8e [2025-03-16 19:07:57,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:07:57,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:07:57,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:07:57,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:07:57,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:07:57,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec5d4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57, skipping insertion in model container [2025-03-16 19:07:57,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:07:57,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2025-03-16 19:07:57,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:07:57,490 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:07:57,535 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2025-03-16 19:07:57,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:07:57,552 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:07:57,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57 WrapperNode [2025-03-16 19:07:57,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:07:57,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:07:57,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:07:57,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:07:57,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,597 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 313 [2025-03-16 19:07:57,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:07:57,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:07:57,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:07:57,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:07:57,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,625 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:07:57,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:07:57,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:07:57,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:07:57,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:07:57,649 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (1/1) ... [2025-03-16 19:07:57,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:07:57,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:07:57,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:07:57,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:07:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:07:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:07:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:07:57,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:07:57,768 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:07:57,771 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:07:58,154 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-16 19:07:58,154 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:07:58,162 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:07:58,163 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:07:58,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:07:58 BoogieIcfgContainer [2025-03-16 19:07:58,163 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:07:58,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:07:58,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:07:58,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:07:58,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:07:57" (1/3) ... [2025-03-16 19:07:58,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775eaf40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:07:58, skipping insertion in model container [2025-03-16 19:07:58,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:57" (2/3) ... [2025-03-16 19:07:58,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775eaf40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:07:58, skipping insertion in model container [2025-03-16 19:07:58,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:07:58" (3/3) ... [2025-03-16 19:07:58,170 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2025-03-16 19:07:58,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:07:58,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c that has 1 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:07:58,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:07:58,222 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;@799e495c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:07:58,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:07:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 78 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 19:07:58,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:58,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:07:58,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:58,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 812665633, now seen corresponding path program 1 times [2025-03-16 19:07:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:58,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628340298] [2025-03-16 19:07:58,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:58,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 19:07:58,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 19:07:58,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:58,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:58,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628340298] [2025-03-16 19:07:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628340298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:58,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:58,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:07:58,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844304141] [2025-03-16 19:07:58,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:58,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:07:58,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:58,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:07:58,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:07:58,414 INFO L87 Difference]: Start difference. First operand has 79 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 78 states have internal predecessors, (136), 0 states have call successors, (0), 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 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:58,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:58,428 INFO L93 Difference]: Finished difference Result 131 states and 220 transitions. [2025-03-16 19:07:58,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:07:58,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-16 19:07:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:58,436 INFO L225 Difference]: With dead ends: 131 [2025-03-16 19:07:58,436 INFO L226 Difference]: Without dead ends: 77 [2025-03-16 19:07:58,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:07:58,441 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:58,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-16 19:07:58,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-16 19:07:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.736842105263158) internal successors, (132), 76 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 132 transitions. [2025-03-16 19:07:58,480 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 132 transitions. Word has length 26 [2025-03-16 19:07:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:58,480 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 132 transitions. [2025-03-16 19:07:58,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 132 transitions. [2025-03-16 19:07:58,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 19:07:58,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:58,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:07:58,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:07:58,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:58,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:58,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2057430114, now seen corresponding path program 1 times [2025-03-16 19:07:58,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:58,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664597021] [2025-03-16 19:07:58,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:58,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:58,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 19:07:58,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 19:07:58,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:58,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:58,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664597021] [2025-03-16 19:07:58,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664597021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:58,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:58,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:07:58,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75313804] [2025-03-16 19:07:58,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:58,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:07:58,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:58,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:07:58,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:07:58,749 INFO L87 Difference]: Start difference. First operand 77 states and 132 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:58,821 INFO L93 Difference]: Finished difference Result 178 states and 295 transitions. [2025-03-16 19:07:58,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:07:58,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-16 19:07:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:58,823 INFO L225 Difference]: With dead ends: 178 [2025-03-16 19:07:58,823 INFO L226 Difference]: Without dead ends: 126 [2025-03-16 19:07:58,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:07:58,824 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 79 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:58,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 358 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:07:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-16 19:07:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 77. [2025-03-16 19:07:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 108 transitions. [2025-03-16 19:07:58,832 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 108 transitions. Word has length 26 [2025-03-16 19:07:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:58,832 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 108 transitions. [2025-03-16 19:07:58,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 108 transitions. [2025-03-16 19:07:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:07:58,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:58,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:07:58,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:07:58,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:58,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:58,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1789084143, now seen corresponding path program 1 times [2025-03-16 19:07:58,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:58,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244335873] [2025-03-16 19:07:58,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:58,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:58,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:07:58,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:07:58,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:58,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:58,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244335873] [2025-03-16 19:07:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244335873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:58,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:58,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:07:58,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565323739] [2025-03-16 19:07:58,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:58,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:07:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:58,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:07:58,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:58,922 INFO L87 Difference]: Start difference. First operand 77 states and 108 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:58,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:58,942 INFO L93 Difference]: Finished difference Result 167 states and 254 transitions. [2025-03-16 19:07:58,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:07:58,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:07:58,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:58,944 INFO L225 Difference]: With dead ends: 167 [2025-03-16 19:07:58,944 INFO L226 Difference]: Without dead ends: 118 [2025-03-16 19:07:58,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:58,945 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 64 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:58,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 234 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:58,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-16 19:07:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-03-16 19:07:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 115 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2025-03-16 19:07:58,951 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 49 [2025-03-16 19:07:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:58,951 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2025-03-16 19:07:58,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2025-03-16 19:07:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:07:58,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:58,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:07:58,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:07:58,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:58,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:58,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1807051742, now seen corresponding path program 1 times [2025-03-16 19:07:58,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:58,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135850366] [2025-03-16 19:07:58,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:58,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:07:58,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:07:58,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:58,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:59,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:59,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135850366] [2025-03-16 19:07:59,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135850366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:59,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:59,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:07:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530302022] [2025-03-16 19:07:59,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:59,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:07:59,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:59,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:07:59,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:59,055 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:59,071 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2025-03-16 19:07:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:07:59,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:07:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:59,073 INFO L225 Difference]: With dead ends: 276 [2025-03-16 19:07:59,073 INFO L226 Difference]: Without dead ends: 188 [2025-03-16 19:07:59,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-03-16 19:07:59,074 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 60 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:59,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-16 19:07:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2025-03-16 19:07:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5405405405405406) internal successors, (285), 185 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 285 transitions. [2025-03-16 19:07:59,084 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 285 transitions. Word has length 49 [2025-03-16 19:07:59,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:59,085 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 285 transitions. [2025-03-16 19:07:59,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 285 transitions. [2025-03-16 19:07:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:07:59,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:59,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:07:59,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:07:59,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:59,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:59,090 INFO L85 PathProgramCache]: Analyzing trace with hash 201390037, now seen corresponding path program 1 times [2025-03-16 19:07:59,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:59,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477972149] [2025-03-16 19:07:59,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:59,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:59,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:07:59,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:07:59,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:59,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:59,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:59,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477972149] [2025-03-16 19:07:59,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477972149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:59,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:59,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:07:59,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829349542] [2025-03-16 19:07:59,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:59,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:07:59,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:59,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:07:59,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:59,163 INFO L87 Difference]: Start difference. First operand 186 states and 285 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:59,184 INFO L93 Difference]: Finished difference Result 470 states and 743 transitions. [2025-03-16 19:07:59,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:07:59,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:07:59,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:59,187 INFO L225 Difference]: With dead ends: 470 [2025-03-16 19:07:59,187 INFO L226 Difference]: Without dead ends: 312 [2025-03-16 19:07:59,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:59,188 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 56 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:59,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 228 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:59,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-16 19:07:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2025-03-16 19:07:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 481 transitions. [2025-03-16 19:07:59,207 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 481 transitions. Word has length 49 [2025-03-16 19:07:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:59,207 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 481 transitions. [2025-03-16 19:07:59,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 481 transitions. [2025-03-16 19:07:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:07:59,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:07:59,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:07:59,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:59,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash 722152712, now seen corresponding path program 1 times [2025-03-16 19:07:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:59,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959294148] [2025-03-16 19:07:59,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:59,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:07:59,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:07:59,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:59,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:59,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959294148] [2025-03-16 19:07:59,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959294148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:59,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:59,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:07:59,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192450600] [2025-03-16 19:07:59,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:59,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:07:59,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:59,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:07:59,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:07:59,335 INFO L87 Difference]: Start difference. First operand 310 states and 481 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:59,458 INFO L93 Difference]: Finished difference Result 1720 states and 2746 transitions. [2025-03-16 19:07:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:07:59,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:07:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:59,465 INFO L225 Difference]: With dead ends: 1720 [2025-03-16 19:07:59,465 INFO L226 Difference]: Without dead ends: 1438 [2025-03-16 19:07:59,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:07:59,469 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 585 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:59,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 842 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:07:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-03-16 19:07:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 590. [2025-03-16 19:07:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.5568760611205432) internal successors, (917), 589 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 917 transitions. [2025-03-16 19:07:59,506 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 917 transitions. Word has length 49 [2025-03-16 19:07:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:59,506 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 917 transitions. [2025-03-16 19:07:59,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 917 transitions. [2025-03-16 19:07:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:07:59,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:59,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:07:59,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:07:59,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:59,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash 912852860, now seen corresponding path program 1 times [2025-03-16 19:07:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350528168] [2025-03-16 19:07:59,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:59,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:07:59,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:07:59,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:59,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350528168] [2025-03-16 19:07:59,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350528168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:59,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:59,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:07:59,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855384189] [2025-03-16 19:07:59,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:59,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:07:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:59,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:07:59,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:07:59,696 INFO L87 Difference]: Start difference. First operand 590 states and 917 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:59,721 INFO L93 Difference]: Finished difference Result 624 states and 966 transitions. [2025-03-16 19:07:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:07:59,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-16 19:07:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:59,723 INFO L225 Difference]: With dead ends: 624 [2025-03-16 19:07:59,724 INFO L226 Difference]: Without dead ends: 622 [2025-03-16 19:07:59,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:07:59,726 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:59,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-16 19:07:59,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2025-03-16 19:07:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 1.5281803542673107) internal successors, (949), 621 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 949 transitions. [2025-03-16 19:07:59,758 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 949 transitions. Word has length 50 [2025-03-16 19:07:59,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:59,759 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 949 transitions. [2025-03-16 19:07:59,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 949 transitions. [2025-03-16 19:07:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:07:59,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:59,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:07:59,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:07:59,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:59,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:59,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1763470520, now seen corresponding path program 1 times [2025-03-16 19:07:59,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:59,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278917778] [2025-03-16 19:07:59,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:59,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:07:59,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:07:59,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:59,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:59,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278917778] [2025-03-16 19:07:59,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278917778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:59,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:59,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:07:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569507705] [2025-03-16 19:07:59,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:59,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:07:59,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:59,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:07:59,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:59,843 INFO L87 Difference]: Start difference. First operand 622 states and 949 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:59,872 INFO L93 Difference]: Finished difference Result 1698 states and 2599 transitions. [2025-03-16 19:07:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:07:59,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 19:07:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:59,876 INFO L225 Difference]: With dead ends: 1698 [2025-03-16 19:07:59,876 INFO L226 Difference]: Without dead ends: 1104 [2025-03-16 19:07:59,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:59,880 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 49 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:59,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2025-03-16 19:07:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1102. [2025-03-16 19:07:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1101 states have (on average 1.508628519527702) internal successors, (1661), 1101 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1661 transitions. [2025-03-16 19:07:59,923 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1661 transitions. Word has length 51 [2025-03-16 19:07:59,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:59,925 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1661 transitions. [2025-03-16 19:07:59,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:07:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1661 transitions. [2025-03-16 19:07:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:07:59,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:59,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:07:59,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:07:59,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:59,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1034154837, now seen corresponding path program 1 times [2025-03-16 19:07:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:59,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116657328] [2025-03-16 19:07:59,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:59,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:07:59,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:07:59,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:59,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:59,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:59,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116657328] [2025-03-16 19:07:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116657328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:59,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:59,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:07:59,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227457693] [2025-03-16 19:07:59,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:59,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:07:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:59,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:07:59,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:59,987 INFO L87 Difference]: Start difference. First operand 1102 states and 1661 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:00,022 INFO L93 Difference]: Finished difference Result 2164 states and 3282 transitions. [2025-03-16 19:08:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:00,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 19:08:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:00,027 INFO L225 Difference]: With dead ends: 2164 [2025-03-16 19:08:00,028 INFO L226 Difference]: Without dead ends: 1570 [2025-03-16 19:08:00,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:00,030 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 68 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:00,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 242 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-16 19:08:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1568. [2025-03-16 19:08:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.4952137843012125) internal successors, (2343), 1567 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2343 transitions. [2025-03-16 19:08:00,088 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2343 transitions. Word has length 51 [2025-03-16 19:08:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:00,089 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2343 transitions. [2025-03-16 19:08:00,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2343 transitions. [2025-03-16 19:08:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:08:00,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:00,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:00,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:08:00,090 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:00,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:00,091 INFO L85 PathProgramCache]: Analyzing trace with hash -743459926, now seen corresponding path program 1 times [2025-03-16 19:08:00,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:00,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404312154] [2025-03-16 19:08:00,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:00,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:00,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:08:00,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:08:00,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:00,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:08:00,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:00,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404312154] [2025-03-16 19:08:00,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404312154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:08:00,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435551541] [2025-03-16 19:08:00,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:00,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:00,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:00,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:08:00,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:08:00,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:08:00,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:08:00,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:00,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:00,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:08:00,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:08:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:00,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:08:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:01,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435551541] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:08:01,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:08:01,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 18 [2025-03-16 19:08:01,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236707292] [2025-03-16 19:08:01,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:08:01,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:08:01,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:01,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:08:01,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:08:01,790 INFO L87 Difference]: Start difference. First operand 1568 states and 2343 transitions. Second operand has 18 states, 18 states have (on average 11.444444444444445) internal successors, (206), 18 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:02,855 INFO L93 Difference]: Finished difference Result 9146 states and 13832 transitions. [2025-03-16 19:08:02,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-16 19:08:02,855 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.444444444444445) internal successors, (206), 18 states have internal predecessors, (206), 0 states have call successors, (0), 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 73 [2025-03-16 19:08:02,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:02,877 INFO L225 Difference]: With dead ends: 9146 [2025-03-16 19:08:02,877 INFO L226 Difference]: Without dead ends: 7608 [2025-03-16 19:08:02,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=538, Invalid=2012, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 19:08:02,882 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 2115 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:02,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 826 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:08:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7608 states. [2025-03-16 19:08:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7608 to 6120. [2025-03-16 19:08:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6120 states, 6119 states have (on average 1.4847197254453341) internal successors, (9085), 6119 states have internal predecessors, (9085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 9085 transitions. [2025-03-16 19:08:03,026 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 9085 transitions. Word has length 73 [2025-03-16 19:08:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:03,026 INFO L471 AbstractCegarLoop]: Abstraction has 6120 states and 9085 transitions. [2025-03-16 19:08:03,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.444444444444445) internal successors, (206), 18 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 9085 transitions. [2025-03-16 19:08:03,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:08:03,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:03,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:03,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:08:03,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 19:08:03,230 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:03,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash 264654037, now seen corresponding path program 1 times [2025-03-16 19:08:03,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:03,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301817913] [2025-03-16 19:08:03,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:03,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:08:03,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:08:03,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:03,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:08:03,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:03,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301817913] [2025-03-16 19:08:03,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301817913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:03,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:03,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:03,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809980925] [2025-03-16 19:08:03,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:03,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:03,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:03,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:03,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:03,389 INFO L87 Difference]: Start difference. First operand 6120 states and 9085 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:03,586 INFO L93 Difference]: Finished difference Result 17744 states and 26577 transitions. [2025-03-16 19:08:03,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:03,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:08:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:03,640 INFO L225 Difference]: With dead ends: 17744 [2025-03-16 19:08:03,640 INFO L226 Difference]: Without dead ends: 14644 [2025-03-16 19:08:03,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:08:03,650 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 458 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:03,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 648 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14644 states. [2025-03-16 19:08:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14644 to 9110. [2025-03-16 19:08:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9110 states, 9109 states have (on average 1.482489845208036) internal successors, (13504), 9109 states have internal predecessors, (13504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9110 states to 9110 states and 13504 transitions. [2025-03-16 19:08:03,898 INFO L78 Accepts]: Start accepts. Automaton has 9110 states and 13504 transitions. Word has length 74 [2025-03-16 19:08:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:03,899 INFO L471 AbstractCegarLoop]: Abstraction has 9110 states and 13504 transitions. [2025-03-16 19:08:03,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 9110 states and 13504 transitions. [2025-03-16 19:08:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:08:03,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:03,901 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:03,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:08:03,901 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:03,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:03,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1045754472, now seen corresponding path program 1 times [2025-03-16 19:08:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458764520] [2025-03-16 19:08:03,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:03,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:03,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:08:03,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:08:03,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:03,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:08:03,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:03,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458764520] [2025-03-16 19:08:03,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458764520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:03,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:03,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:03,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898401422] [2025-03-16 19:08:03,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:03,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:03,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:03,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:03,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:03,995 INFO L87 Difference]: Start difference. First operand 9110 states and 13504 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:04,218 INFO L93 Difference]: Finished difference Result 20734 states and 30996 transitions. [2025-03-16 19:08:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:04,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 74 [2025-03-16 19:08:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:04,247 INFO L225 Difference]: With dead ends: 20734 [2025-03-16 19:08:04,247 INFO L226 Difference]: Without dead ends: 17634 [2025-03-16 19:08:04,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:08:04,253 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 494 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:04,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 605 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17634 states. [2025-03-16 19:08:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17634 to 12100. [2025-03-16 19:08:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12100 states, 12099 states have (on average 1.4813620960409952) internal successors, (17923), 12099 states have internal predecessors, (17923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12100 states to 12100 states and 17923 transitions. [2025-03-16 19:08:04,530 INFO L78 Accepts]: Start accepts. Automaton has 12100 states and 17923 transitions. Word has length 74 [2025-03-16 19:08:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:04,530 INFO L471 AbstractCegarLoop]: Abstraction has 12100 states and 17923 transitions. [2025-03-16 19:08:04,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 12100 states and 17923 transitions. [2025-03-16 19:08:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:08:04,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:04,532 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:04,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:08:04,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:04,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:04,533 INFO L85 PathProgramCache]: Analyzing trace with hash -665246648, now seen corresponding path program 1 times [2025-03-16 19:08:04,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:04,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158671885] [2025-03-16 19:08:04,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:04,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:08:04,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:08:04,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:04,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:08:04,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:04,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158671885] [2025-03-16 19:08:04,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158671885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:04,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:04,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:04,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547397477] [2025-03-16 19:08:04,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:04,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:04,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:04,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:04,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:04,622 INFO L87 Difference]: Start difference. First operand 12100 states and 17923 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:04,863 INFO L93 Difference]: Finished difference Result 23724 states and 35415 transitions. [2025-03-16 19:08:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:04,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 74 [2025-03-16 19:08:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:04,899 INFO L225 Difference]: With dead ends: 23724 [2025-03-16 19:08:04,899 INFO L226 Difference]: Without dead ends: 20624 [2025-03-16 19:08:04,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:08:04,907 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 467 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:04,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 637 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20624 states. [2025-03-16 19:08:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20624 to 15090. [2025-03-16 19:08:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15090 states, 15089 states have (on average 1.4806812910066935) internal successors, (22342), 15089 states have internal predecessors, (22342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15090 states to 15090 states and 22342 transitions. [2025-03-16 19:08:05,304 INFO L78 Accepts]: Start accepts. Automaton has 15090 states and 22342 transitions. Word has length 74 [2025-03-16 19:08:05,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:05,305 INFO L471 AbstractCegarLoop]: Abstraction has 15090 states and 22342 transitions. [2025-03-16 19:08:05,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 15090 states and 22342 transitions. [2025-03-16 19:08:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:08:05,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:05,308 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:05,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:08:05,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:05,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash -330937771, now seen corresponding path program 1 times [2025-03-16 19:08:05,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:05,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855584504] [2025-03-16 19:08:05,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:05,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:05,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:08:05,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:08:05,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:05,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:08:05,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:05,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855584504] [2025-03-16 19:08:05,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855584504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:05,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:05,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:05,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978619109] [2025-03-16 19:08:05,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:05,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:05,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:05,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:05,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:05,411 INFO L87 Difference]: Start difference. First operand 15090 states and 22342 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:05,752 INFO L93 Difference]: Finished difference Result 24938 states and 37125 transitions. [2025-03-16 19:08:05,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:05,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 74 [2025-03-16 19:08:05,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:05,789 INFO L225 Difference]: With dead ends: 24938 [2025-03-16 19:08:05,789 INFO L226 Difference]: Without dead ends: 22980 [2025-03-16 19:08:05,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:08:05,795 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 456 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:05,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 716 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22980 states. [2025-03-16 19:08:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22980 to 17446. [2025-03-16 19:08:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17446 states, 17445 states have (on average 1.4788191458870736) internal successors, (25798), 17445 states have internal predecessors, (25798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17446 states to 17446 states and 25798 transitions. [2025-03-16 19:08:06,088 INFO L78 Accepts]: Start accepts. Automaton has 17446 states and 25798 transitions. Word has length 74 [2025-03-16 19:08:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:06,088 INFO L471 AbstractCegarLoop]: Abstraction has 17446 states and 25798 transitions. [2025-03-16 19:08:06,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 17446 states and 25798 transitions. [2025-03-16 19:08:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:08:06,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:06,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:06,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:08:06,091 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:06,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:06,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1713537213, now seen corresponding path program 1 times [2025-03-16 19:08:06,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:06,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927025152] [2025-03-16 19:08:06,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:06,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:06,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:08:06,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:08:06,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:06,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:06,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:06,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927025152] [2025-03-16 19:08:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927025152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:06,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:06,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:06,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003608229] [2025-03-16 19:08:06,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:06,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:06,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:06,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:06,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:06,151 INFO L87 Difference]: Start difference. First operand 17446 states and 25798 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:06,313 INFO L93 Difference]: Finished difference Result 28559 states and 42086 transitions. [2025-03-16 19:08:06,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:06,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:08:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:06,331 INFO L225 Difference]: With dead ends: 28559 [2025-03-16 19:08:06,332 INFO L226 Difference]: Without dead ends: 11143 [2025-03-16 19:08:06,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:06,346 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 54 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:06,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 238 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11143 states. [2025-03-16 19:08:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11143 to 10605. [2025-03-16 19:08:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10605 states, 10604 states have (on average 1.4667106752168992) internal successors, (15553), 10604 states have internal predecessors, (15553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10605 states to 10605 states and 15553 transitions. [2025-03-16 19:08:06,505 INFO L78 Accepts]: Start accepts. Automaton has 10605 states and 15553 transitions. Word has length 77 [2025-03-16 19:08:06,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:06,505 INFO L471 AbstractCegarLoop]: Abstraction has 10605 states and 15553 transitions. [2025-03-16 19:08:06,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 10605 states and 15553 transitions. [2025-03-16 19:08:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:08:06,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:06,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:06,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:08:06,507 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:06,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:06,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1034677296, now seen corresponding path program 1 times [2025-03-16 19:08:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:06,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873033995] [2025-03-16 19:08:06,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:06,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:06,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:08:06,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:08:06,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:06,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:06,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:06,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873033995] [2025-03-16 19:08:06,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873033995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:06,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:06,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113433421] [2025-03-16 19:08:06,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:06,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:06,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:06,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:06,585 INFO L87 Difference]: Start difference. First operand 10605 states and 15553 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:06,645 INFO L93 Difference]: Finished difference Result 14701 states and 21627 transitions. [2025-03-16 19:08:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:06,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:08:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:06,656 INFO L225 Difference]: With dead ends: 14701 [2025-03-16 19:08:06,656 INFO L226 Difference]: Without dead ends: 5495 [2025-03-16 19:08:06,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-03-16 19:08:06,664 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 42 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:06,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 213 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5495 states. [2025-03-16 19:08:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5495 to 5385. [2025-03-16 19:08:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5385 states, 5384 states have (on average 1.4396359583952452) internal successors, (7751), 5384 states have internal predecessors, (7751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 7751 transitions. [2025-03-16 19:08:06,785 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 7751 transitions. Word has length 77 [2025-03-16 19:08:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:06,785 INFO L471 AbstractCegarLoop]: Abstraction has 5385 states and 7751 transitions. [2025-03-16 19:08:06,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 7751 transitions. [2025-03-16 19:08:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:08:06,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:06,786 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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-03-16 19:08:06,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:08:06,787 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:06,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:06,787 INFO L85 PathProgramCache]: Analyzing trace with hash 104776611, now seen corresponding path program 1 times [2025-03-16 19:08:06,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:06,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208609698] [2025-03-16 19:08:06,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:06,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:06,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:08:06,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:08:06,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:06,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:07,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:07,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208609698] [2025-03-16 19:08:07,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208609698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:08:07,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231098492] [2025-03-16 19:08:07,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:07,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:07,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:07,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:08:07,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:08:07,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:08:07,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:08:07,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:07,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:07,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 19:08:07,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:08:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:07,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:08:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:07,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231098492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:08:07,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:08:07,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-16 19:08:07,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757822983] [2025-03-16 19:08:07,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:08:07,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 19:08:07,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:07,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 19:08:07,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:08:07,940 INFO L87 Difference]: Start difference. First operand 5385 states and 7751 transitions. Second operand has 20 states, 20 states have (on average 8.4) internal successors, (168), 19 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:08,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:08,659 INFO L93 Difference]: Finished difference Result 20917 states and 30316 transitions. [2025-03-16 19:08:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:08:08,660 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.4) internal successors, (168), 19 states have internal predecessors, (168), 0 states have call successors, (0), 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 77 [2025-03-16 19:08:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:08,685 INFO L225 Difference]: With dead ends: 20917 [2025-03-16 19:08:08,685 INFO L226 Difference]: Without dead ends: 16553 [2025-03-16 19:08:08,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 19:08:08,694 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1505 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:08,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 800 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:08:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16553 states. [2025-03-16 19:08:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16553 to 11990. [2025-03-16 19:08:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11990 states, 11989 states have (on average 1.4333972808407707) internal successors, (17185), 11989 states have internal predecessors, (17185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11990 states to 11990 states and 17185 transitions. [2025-03-16 19:08:08,995 INFO L78 Accepts]: Start accepts. Automaton has 11990 states and 17185 transitions. Word has length 77 [2025-03-16 19:08:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:08,995 INFO L471 AbstractCegarLoop]: Abstraction has 11990 states and 17185 transitions. [2025-03-16 19:08:08,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.4) internal successors, (168), 19 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 11990 states and 17185 transitions. [2025-03-16 19:08:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:08:08,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:08,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:09,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:08:09,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 19:08:09,198 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:09,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:09,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1284858000, now seen corresponding path program 1 times [2025-03-16 19:08:09,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:09,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137696607] [2025-03-16 19:08:09,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:09,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:08:09,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:08:09,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:09,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:09,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:09,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137696607] [2025-03-16 19:08:09,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137696607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:09,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:09,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:09,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324054878] [2025-03-16 19:08:09,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:09,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:09,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:09,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:09,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:09,268 INFO L87 Difference]: Start difference. First operand 11990 states and 17185 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:09,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:09,380 INFO L93 Difference]: Finished difference Result 17700 states and 25446 transitions. [2025-03-16 19:08:09,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:09,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:08:09,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:09,393 INFO L225 Difference]: With dead ends: 17700 [2025-03-16 19:08:09,393 INFO L226 Difference]: Without dead ends: 6943 [2025-03-16 19:08:09,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:09,403 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 35 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:09,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 203 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6943 states. [2025-03-16 19:08:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6943 to 6941. [2025-03-16 19:08:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6941 states, 6940 states have (on average 1.4064841498559078) internal successors, (9761), 6940 states have internal predecessors, (9761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6941 states to 6941 states and 9761 transitions. [2025-03-16 19:08:09,566 INFO L78 Accepts]: Start accepts. Automaton has 6941 states and 9761 transitions. Word has length 77 [2025-03-16 19:08:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:09,566 INFO L471 AbstractCegarLoop]: Abstraction has 6941 states and 9761 transitions. [2025-03-16 19:08:09,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 6941 states and 9761 transitions. [2025-03-16 19:08:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:08:09,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:09,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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-03-16 19:08:09,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:08:09,568 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:09,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1003928912, now seen corresponding path program 1 times [2025-03-16 19:08:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576564092] [2025-03-16 19:08:09,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:09,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:09,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:08:09,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:08:09,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:09,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:10,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:10,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576564092] [2025-03-16 19:08:10,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576564092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:08:10,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469116489] [2025-03-16 19:08:10,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:10,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:10,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:10,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:08:10,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:08:10,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:08:10,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:08:10,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:10,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:10,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:08:10,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:08:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:10,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:08:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:11,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469116489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:08:11,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:08:11,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2025-03-16 19:08:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309765245] [2025-03-16 19:08:11,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:08:11,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 19:08:11,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:11,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 19:08:11,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:08:11,578 INFO L87 Difference]: Start difference. First operand 6941 states and 9761 transitions. Second operand has 26 states, 26 states have (on average 7.461538461538462) internal successors, (194), 25 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:13,750 INFO L93 Difference]: Finished difference Result 53261 states and 74788 transitions. [2025-03-16 19:08:13,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-16 19:08:13,751 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.461538461538462) internal successors, (194), 25 states have internal predecessors, (194), 0 states have call successors, (0), 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 77 [2025-03-16 19:08:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:13,810 INFO L225 Difference]: With dead ends: 53261 [2025-03-16 19:08:13,811 INFO L226 Difference]: Without dead ends: 47126 [2025-03-16 19:08:13,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=723, Invalid=3309, Unknown=0, NotChecked=0, Total=4032 [2025-03-16 19:08:13,832 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 2395 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:13,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 1781 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:08:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47126 states. [2025-03-16 19:08:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47126 to 33078. [2025-03-16 19:08:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33078 states, 33077 states have (on average 1.3819270187743748) internal successors, (45710), 33077 states have internal predecessors, (45710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33078 states to 33078 states and 45710 transitions. [2025-03-16 19:08:14,511 INFO L78 Accepts]: Start accepts. Automaton has 33078 states and 45710 transitions. Word has length 77 [2025-03-16 19:08:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:14,512 INFO L471 AbstractCegarLoop]: Abstraction has 33078 states and 45710 transitions. [2025-03-16 19:08:14,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.461538461538462) internal successors, (194), 25 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 33078 states and 45710 transitions. [2025-03-16 19:08:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:08:14,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:14,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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-03-16 19:08:14,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:08:14,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:14,715 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:14,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash -274617207, now seen corresponding path program 1 times [2025-03-16 19:08:14,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:14,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277437137] [2025-03-16 19:08:14,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:14,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:14,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:08:14,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:08:14,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:14,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:14,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:14,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277437137] [2025-03-16 19:08:14,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277437137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:14,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:14,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:14,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259756214] [2025-03-16 19:08:14,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:14,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:14,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:14,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:14,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:14,762 INFO L87 Difference]: Start difference. First operand 33078 states and 45710 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:15,361 INFO L93 Difference]: Finished difference Result 83568 states and 115276 transitions. [2025-03-16 19:08:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:15,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:08:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:15,423 INFO L225 Difference]: With dead ends: 83568 [2025-03-16 19:08:15,423 INFO L226 Difference]: Without dead ends: 51747 [2025-03-16 19:08:15,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:15,449 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 53 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:15,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 210 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51747 states. [2025-03-16 19:08:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51747 to 51745. [2025-03-16 19:08:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51745 states, 51744 states have (on average 1.3646992888064318) internal successors, (70615), 51744 states have internal predecessors, (70615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51745 states to 51745 states and 70615 transitions. [2025-03-16 19:08:16,511 INFO L78 Accepts]: Start accepts. Automaton has 51745 states and 70615 transitions. Word has length 78 [2025-03-16 19:08:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:16,511 INFO L471 AbstractCegarLoop]: Abstraction has 51745 states and 70615 transitions. [2025-03-16 19:08:16,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 51745 states and 70615 transitions. [2025-03-16 19:08:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:08:16,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:16,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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-03-16 19:08:16,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:08:16,515 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:16,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1435878919, now seen corresponding path program 1 times [2025-03-16 19:08:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:16,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654338354] [2025-03-16 19:08:16,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:16,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:16,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:08:16,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:08:16,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:16,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:16,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:16,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654338354] [2025-03-16 19:08:16,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654338354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:16,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:16,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:16,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555269675] [2025-03-16 19:08:16,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:16,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:16,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:16,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:16,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:16,557 INFO L87 Difference]: Start difference. First operand 51745 states and 70615 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:17,868 INFO L93 Difference]: Finished difference Result 133864 states and 182226 transitions. [2025-03-16 19:08:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:17,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:08:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:17,972 INFO L225 Difference]: With dead ends: 133864 [2025-03-16 19:08:17,972 INFO L226 Difference]: Without dead ends: 84801 [2025-03-16 19:08:18,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:18,014 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 50 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:18,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 214 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84801 states. [2025-03-16 19:08:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84801 to 84799. [2025-03-16 19:08:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84799 states, 84798 states have (on average 1.3425906271374324) internal successors, (113849), 84798 states have internal predecessors, (113849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84799 states to 84799 states and 113849 transitions. [2025-03-16 19:08:20,060 INFO L78 Accepts]: Start accepts. Automaton has 84799 states and 113849 transitions. Word has length 78 [2025-03-16 19:08:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:20,060 INFO L471 AbstractCegarLoop]: Abstraction has 84799 states and 113849 transitions. [2025-03-16 19:08:20,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 84799 states and 113849 transitions. [2025-03-16 19:08:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:08:20,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:20,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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-03-16 19:08:20,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:08:20,066 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:20,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:20,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1476819241, now seen corresponding path program 1 times [2025-03-16 19:08:20,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:20,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531115296] [2025-03-16 19:08:20,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:20,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:20,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:08:20,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:08:20,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:20,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:20,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:20,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531115296] [2025-03-16 19:08:20,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531115296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:20,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:20,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:20,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105267180] [2025-03-16 19:08:20,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:20,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:20,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:20,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:20,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:20,102 INFO L87 Difference]: Start difference. First operand 84799 states and 113849 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:22,013 INFO L93 Difference]: Finished difference Result 204695 states and 273787 transitions. [2025-03-16 19:08:22,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:22,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:08:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:22,174 INFO L225 Difference]: With dead ends: 204695 [2025-03-16 19:08:22,174 INFO L226 Difference]: Without dead ends: 129260 [2025-03-16 19:08:22,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:22,230 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 47 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:22,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 239 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129260 states. [2025-03-16 19:08:25,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129260 to 128225. [2025-03-16 19:08:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128225 states, 128224 states have (on average 1.313537247317195) internal successors, (168427), 128224 states have internal predecessors, (168427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128225 states to 128225 states and 168427 transitions. [2025-03-16 19:08:25,495 INFO L78 Accepts]: Start accepts. Automaton has 128225 states and 168427 transitions. Word has length 78 [2025-03-16 19:08:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:25,495 INFO L471 AbstractCegarLoop]: Abstraction has 128225 states and 168427 transitions. [2025-03-16 19:08:25,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 128225 states and 168427 transitions. [2025-03-16 19:08:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:08:25,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:25,503 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:25,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:08:25,503 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:25,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:25,504 INFO L85 PathProgramCache]: Analyzing trace with hash -186002493, now seen corresponding path program 1 times [2025-03-16 19:08:25,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:25,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984223722] [2025-03-16 19:08:25,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:25,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:25,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:08:25,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:08:25,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:25,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:25,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:25,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984223722] [2025-03-16 19:08:25,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984223722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:25,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:25,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214348802] [2025-03-16 19:08:25,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:25,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:25,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:25,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:25,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:25,542 INFO L87 Difference]: Start difference. First operand 128225 states and 168427 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:27,509 INFO L93 Difference]: Finished difference Result 182743 states and 240048 transitions. [2025-03-16 19:08:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:27,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:08:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:27,658 INFO L225 Difference]: With dead ends: 182743 [2025-03-16 19:08:27,658 INFO L226 Difference]: Without dead ends: 117567 [2025-03-16 19:08:27,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:27,703 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 47 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:27,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 266 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117567 states. [2025-03-16 19:08:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117567 to 114204. [2025-03-16 19:08:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114204 states, 114203 states have (on average 1.3048256175406951) internal successors, (149015), 114203 states have internal predecessors, (149015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114204 states to 114204 states and 149015 transitions. [2025-03-16 19:08:30,390 INFO L78 Accepts]: Start accepts. Automaton has 114204 states and 149015 transitions. Word has length 78 [2025-03-16 19:08:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:30,390 INFO L471 AbstractCegarLoop]: Abstraction has 114204 states and 149015 transitions. [2025-03-16 19:08:30,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 114204 states and 149015 transitions. [2025-03-16 19:08:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:08:30,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:30,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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-03-16 19:08:30,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:08:30,399 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:30,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2035995594, now seen corresponding path program 1 times [2025-03-16 19:08:30,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:30,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796376983] [2025-03-16 19:08:30,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:30,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:30,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:08:30,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:08:30,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:30,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:31,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:31,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796376983] [2025-03-16 19:08:31,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796376983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:08:31,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080803659] [2025-03-16 19:08:31,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:31,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:31,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:31,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:08:31,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:08:31,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:08:31,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:08:31,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:31,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:31,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 19:08:31,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:08:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:31,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:08:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:31,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080803659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:08:31,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:08:31,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2025-03-16 19:08:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714849548] [2025-03-16 19:08:31,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:08:31,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 19:08:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:31,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 19:08:31,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:08:31,878 INFO L87 Difference]: Start difference. First operand 114204 states and 149015 transitions. Second operand has 26 states, 26 states have (on average 8.23076923076923) internal successors, (214), 25 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:36,878 INFO L93 Difference]: Finished difference Result 308710 states and 408313 transitions. [2025-03-16 19:08:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-16 19:08:36,878 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.23076923076923) internal successors, (214), 25 states have internal predecessors, (214), 0 states have call successors, (0), 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 78 [2025-03-16 19:08:36,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:37,125 INFO L225 Difference]: With dead ends: 308710 [2025-03-16 19:08:37,126 INFO L226 Difference]: Without dead ends: 208504 [2025-03-16 19:08:37,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1611 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1134, Invalid=4718, Unknown=0, NotChecked=0, Total=5852 [2025-03-16 19:08:37,184 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 3731 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3731 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:37,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3731 Valid, 1081 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:08:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208504 states.