./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/eca-rers2012/Problem17_label37.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 8bd98135d8ae582748799a59c9940e3e8b9dde2a3b5c340030fcdb71a0e998f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:10:32,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:10:32,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:10:32,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:10:32,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:10:32,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:10:32,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:10:32,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:10:32,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:10:32,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:10:32,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:10:32,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:10:32,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:10:32,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:10:32,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:10:32,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:10:32,486 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 -> 8bd98135d8ae582748799a59c9940e3e8b9dde2a3b5c340030fcdb71a0e998f7 [2025-03-08 02:10:32,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:10:32,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:10:32,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:10:32,708 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:10:32,708 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:10:32,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label37.c [2025-03-08 02:10:33,850 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2b7ff40/c8c30c63333443d1a1e675bf77c67efd/FLAGd24173acc [2025-03-08 02:10:34,250 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:10:34,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label37.c [2025-03-08 02:10:34,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2b7ff40/c8c30c63333443d1a1e675bf77c67efd/FLAGd24173acc [2025-03-08 02:10:34,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2b7ff40/c8c30c63333443d1a1e675bf77c67efd [2025-03-08 02:10:34,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:10:34,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:10:34,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:10:34,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:10:34,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:10:34,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:10:34" (1/1) ... [2025-03-08 02:10:34,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf8b581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:34, skipping insertion in model container [2025-03-08 02:10:34,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:10:34" (1/1) ... [2025-03-08 02:10:34,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:10:34,512 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/eca-rers2012/Problem17_label37.c[2848,2861] [2025-03-08 02:10:34,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:10:34,879 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:10:34,891 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/eca-rers2012/Problem17_label37.c[2848,2861] [2025-03-08 02:10:35,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:10:35,128 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:10:35,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35 WrapperNode [2025-03-08 02:10:35,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:10:35,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:10:35,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:10:35,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:10:35,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,398 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:10:35,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:10:35,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:10:35,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:10:35,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:10:35,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,617 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-08 02:10:35,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:10:35,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:10:35,876 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:10:35,876 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:10:35,877 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (1/1) ... [2025-03-08 02:10:35,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:10:35,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:10:35,908 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-08 02:10:35,914 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-08 02:10:35,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:10:35,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:10:35,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:10:35,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:10:35,975 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:10:35,976 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:10:38,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:10:38,537 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:10:38,537 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:10:38,564 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:10:38,565 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:10:38,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:10:38 BoogieIcfgContainer [2025-03-08 02:10:38,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:10:38,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:10:38,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:10:38,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:10:38,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:10:34" (1/3) ... [2025-03-08 02:10:38,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a44b055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:10:38, skipping insertion in model container [2025-03-08 02:10:38,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:35" (2/3) ... [2025-03-08 02:10:38,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a44b055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:10:38, skipping insertion in model container [2025-03-08 02:10:38,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:10:38" (3/3) ... [2025-03-08 02:10:38,580 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label37.c [2025-03-08 02:10:38,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:10:38,595 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label37.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:10:38,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:10:38,702 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;@5a77b718, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:10:38,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:10:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 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-08 02:10:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 02:10:38,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:38,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:38,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:38,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash -806925140, now seen corresponding path program 1 times [2025-03-08 02:10:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:38,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262330129] [2025-03-08 02:10:38,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:38,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:38,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 02:10:38,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 02:10:38,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:38,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:38,912 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-08 02:10:38,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:38,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262330129] [2025-03-08 02:10:38,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262330129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:38,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:38,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394499223] [2025-03-08 02:10:38,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:38,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:38,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:38,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:38,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:38,937 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:41,064 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-03-08 02:10:41,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:41,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 02:10:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:41,085 INFO L225 Difference]: With dead ends: 1667 [2025-03-08 02:10:41,085 INFO L226 Difference]: Without dead ends: 998 [2025-03-08 02:10:41,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08 02:10:41,091 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 527 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:41,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:10:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-08 02:10:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-03-08 02:10:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 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-08 02:10:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-03-08 02:10:41,170 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 18 [2025-03-08 02:10:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:41,171 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-03-08 02:10:41,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-03-08 02:10:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 02:10:41,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:41,174 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2025-03-08 02:10:41,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:10:41,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:41,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1857434867, now seen corresponding path program 1 times [2025-03-08 02:10:41,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:41,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711782961] [2025-03-08 02:10:41,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:41,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:41,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 02:10:41,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 02:10:41,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:41,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:41,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:41,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711782961] [2025-03-08 02:10:41,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711782961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:41,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:41,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919821940] [2025-03-08 02:10:41,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:41,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:41,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:41,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:41,420 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:42,954 INFO L93 Difference]: Finished difference Result 2824 states and 4847 transitions. [2025-03-08 02:10:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:42,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-08 02:10:42,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:42,961 INFO L225 Difference]: With dead ends: 2824 [2025-03-08 02:10:42,961 INFO L226 Difference]: Without dead ends: 1844 [2025-03-08 02:10:42,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08 02:10:42,963 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 393 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:42,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:10:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-08 02:10:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2025-03-08 02:10:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.3836136733586544) internal successors, (2550), 1843 states have internal predecessors, (2550), 0 states have call successors, (0), 0 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-08 02:10:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2550 transitions. [2025-03-08 02:10:42,998 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2550 transitions. Word has length 83 [2025-03-08 02:10:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:42,999 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2550 transitions. [2025-03-08 02:10:42,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2550 transitions. [2025-03-08 02:10:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 02:10:43,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:43,004 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:10:43,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:10:43,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:43,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:43,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1163282277, now seen corresponding path program 1 times [2025-03-08 02:10:43,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:43,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905623074] [2025-03-08 02:10:43,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:43,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:43,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 02:10:43,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 02:10:43,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:43,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:43,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:43,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905623074] [2025-03-08 02:10:43,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905623074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:43,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:43,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:43,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617656771] [2025-03-08 02:10:43,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:43,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:43,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:43,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:43,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:43,319 INFO L87 Difference]: Start difference. First operand 1844 states and 2550 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-08 02:10:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:45,089 INFO L93 Difference]: Finished difference Result 4546 states and 6595 transitions. [2025-03-08 02:10:45,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:45,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-08 02:10:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:45,097 INFO L225 Difference]: With dead ends: 4546 [2025-03-08 02:10:45,097 INFO L226 Difference]: Without dead ends: 2704 [2025-03-08 02:10:45,099 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-08 02:10:45,100 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:45,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 817 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:10:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-08 02:10:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-03-08 02:10:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.38771735109138) internal successors, (3751), 2703 states have internal predecessors, (3751), 0 states have call successors, (0), 0 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-08 02:10:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3751 transitions. [2025-03-08 02:10:45,141 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3751 transitions. Word has length 166 [2025-03-08 02:10:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:45,141 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3751 transitions. [2025-03-08 02:10:45,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-08 02:10:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3751 transitions. [2025-03-08 02:10:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 02:10:45,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:45,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:10:45,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:10:45,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:45,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:45,144 INFO L85 PathProgramCache]: Analyzing trace with hash 818511788, now seen corresponding path program 1 times [2025-03-08 02:10:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642191487] [2025-03-08 02:10:45,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:45,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 02:10:45,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 02:10:45,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:45,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 02:10:45,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:45,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642191487] [2025-03-08 02:10:45,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642191487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:45,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:45,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476776892] [2025-03-08 02:10:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:45,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:45,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:45,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:45,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:45,280 INFO L87 Difference]: Start difference. First operand 2704 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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-08 02:10:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:46,771 INFO L93 Difference]: Finished difference Result 7954 states and 11040 transitions. [2025-03-08 02:10:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:46,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 172 [2025-03-08 02:10:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:46,786 INFO L225 Difference]: With dead ends: 7954 [2025-03-08 02:10:46,786 INFO L226 Difference]: Without dead ends: 5252 [2025-03-08 02:10:46,790 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-08 02:10:46,791 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 430 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:46,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 546 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:10:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2025-03-08 02:10:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 4826. [2025-03-08 02:10:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.2652849740932643) internal successors, (6105), 4825 states have internal predecessors, (6105), 0 states have call successors, (0), 0 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-08 02:10:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 6105 transitions. [2025-03-08 02:10:46,853 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 6105 transitions. Word has length 172 [2025-03-08 02:10:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:46,854 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 6105 transitions. [2025-03-08 02:10:46,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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-08 02:10:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 6105 transitions. [2025-03-08 02:10:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 02:10:46,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:46,856 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:46,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:10:46,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:46,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:46,857 INFO L85 PathProgramCache]: Analyzing trace with hash 210408134, now seen corresponding path program 1 times [2025-03-08 02:10:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:46,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484335606] [2025-03-08 02:10:46,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:46,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:46,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 02:10:46,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 02:10:46,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:46,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:10:47,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:47,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484335606] [2025-03-08 02:10:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484335606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:47,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:47,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446012699] [2025-03-08 02:10:47,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:47,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:47,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:47,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:47,070 INFO L87 Difference]: Start difference. First operand 4826 states and 6105 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-08 02:10:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:48,667 INFO L93 Difference]: Finished difference Result 13481 states and 17131 transitions. [2025-03-08 02:10:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:48,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 185 [2025-03-08 02:10:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:48,688 INFO L225 Difference]: With dead ends: 13481 [2025-03-08 02:10:48,688 INFO L226 Difference]: Without dead ends: 8657 [2025-03-08 02:10:48,693 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-08 02:10:48,693 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 466 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:48,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 483 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:10:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2025-03-08 02:10:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 7378. [2025-03-08 02:10:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7378 states, 7377 states have (on average 1.2479327639962043) internal successors, (9206), 7377 states have internal predecessors, (9206), 0 states have call successors, (0), 0 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-08 02:10:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7378 states to 7378 states and 9206 transitions. [2025-03-08 02:10:48,794 INFO L78 Accepts]: Start accepts. Automaton has 7378 states and 9206 transitions. Word has length 185 [2025-03-08 02:10:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:48,795 INFO L471 AbstractCegarLoop]: Abstraction has 7378 states and 9206 transitions. [2025-03-08 02:10:48,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-08 02:10:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 7378 states and 9206 transitions. [2025-03-08 02:10:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 02:10:48,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:48,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-03-08 02:10:48,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:10:48,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:48,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash -85065858, now seen corresponding path program 1 times [2025-03-08 02:10:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:48,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224641336] [2025-03-08 02:10:48,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:48,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 02:10:48,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 02:10:48,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:48,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:10:49,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:49,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224641336] [2025-03-08 02:10:49,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224641336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:49,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:49,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:49,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544398574] [2025-03-08 02:10:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:49,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:49,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:49,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:49,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:49,023 INFO L87 Difference]: Start difference. First operand 7378 states and 9206 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-08 02:10:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:50,697 INFO L93 Difference]: Finished difference Result 18607 states and 23435 transitions. [2025-03-08 02:10:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:50,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 234 [2025-03-08 02:10:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:50,722 INFO L225 Difference]: With dead ends: 18607 [2025-03-08 02:10:50,722 INFO L226 Difference]: Without dead ends: 10379 [2025-03-08 02:10:50,729 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-08 02:10:50,730 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 482 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:50,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1020 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:10:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2025-03-08 02:10:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10371. [2025-03-08 02:10:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10371 states, 10370 states have (on average 1.2060752169720348) internal successors, (12507), 10370 states have internal predecessors, (12507), 0 states have call successors, (0), 0 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-08 02:10:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10371 states to 10371 states and 12507 transitions. [2025-03-08 02:10:50,954 INFO L78 Accepts]: Start accepts. Automaton has 10371 states and 12507 transitions. Word has length 234 [2025-03-08 02:10:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:50,954 INFO L471 AbstractCegarLoop]: Abstraction has 10371 states and 12507 transitions. [2025-03-08 02:10:50,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-08 02:10:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 10371 states and 12507 transitions. [2025-03-08 02:10:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-08 02:10:50,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:50,962 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:50,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:10:50,962 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:50,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1404426420, now seen corresponding path program 1 times [2025-03-08 02:10:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260613263] [2025-03-08 02:10:50,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:50,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:51,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-08 02:10:51,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-08 02:10:51,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:51,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 170 proven. 70 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 02:10:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:51,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260613263] [2025-03-08 02:10:51,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260613263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:51,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819678410] [2025-03-08 02:10:51,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:10:51,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:10:51,371 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-08 02:10:51,409 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-08 02:10:51,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-08 02:10:51,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-08 02:10:51,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:51,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:51,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:10:51,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:10:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 170 proven. 70 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 02:10:51,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:10:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 02:10:51,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819678410] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:51,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:10:51,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:10:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876746656] [2025-03-08 02:10:51,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:51,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:51,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:51,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:51,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:10:51,957 INFO L87 Difference]: Start difference. First operand 10371 states and 12507 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-08 02:10:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:54,381 INFO L93 Difference]: Finished difference Result 32691 states and 39751 transitions. [2025-03-08 02:10:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 242 [2025-03-08 02:10:54,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:54,418 INFO L225 Difference]: With dead ends: 32691 [2025-03-08 02:10:54,419 INFO L226 Difference]: Without dead ends: 21461 [2025-03-08 02:10:54,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:10:54,430 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 903 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 852 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 852 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:54,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 157 Invalid, 3171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [852 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 02:10:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21461 states. [2025-03-08 02:10:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21461 to 21459. [2025-03-08 02:10:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21459 states, 21458 states have (on average 1.1587752819461272) internal successors, (24865), 21458 states have internal predecessors, (24865), 0 states have call successors, (0), 0 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-08 02:10:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21459 states to 21459 states and 24865 transitions. [2025-03-08 02:10:54,724 INFO L78 Accepts]: Start accepts. Automaton has 21459 states and 24865 transitions. Word has length 242 [2025-03-08 02:10:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:54,725 INFO L471 AbstractCegarLoop]: Abstraction has 21459 states and 24865 transitions. [2025-03-08 02:10:54,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-08 02:10:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 21459 states and 24865 transitions. [2025-03-08 02:10:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-08 02:10:54,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:54,732 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:54,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:10:54,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:10:54,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:54,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:54,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1944088914, now seen corresponding path program 1 times [2025-03-08 02:10:54,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:54,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978496522] [2025-03-08 02:10:54,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:54,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-08 02:10:54,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-08 02:10:54,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:54,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:10:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978496522] [2025-03-08 02:10:55,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978496522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:55,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:55,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977450154] [2025-03-08 02:10:55,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:55,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:55,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:55,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:55,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:55,091 INFO L87 Difference]: Start difference. First operand 21459 states and 24865 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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-08 02:10:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:56,447 INFO L93 Difference]: Finished difference Result 47592 states and 55279 transitions. [2025-03-08 02:10:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 255 [2025-03-08 02:10:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:56,486 INFO L225 Difference]: With dead ends: 47592 [2025-03-08 02:10:56,486 INFO L226 Difference]: Without dead ends: 25708 [2025-03-08 02:10:56,504 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-08 02:10:56,505 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 371 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:56,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 860 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:10:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25708 states. [2025-03-08 02:10:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25708 to 25708. [2025-03-08 02:10:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25708 states, 25707 states have (on average 1.1349048897187537) internal successors, (29175), 25707 states have internal predecessors, (29175), 0 states have call successors, (0), 0 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-08 02:10:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25708 states to 25708 states and 29175 transitions. [2025-03-08 02:10:56,765 INFO L78 Accepts]: Start accepts. Automaton has 25708 states and 29175 transitions. Word has length 255 [2025-03-08 02:10:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:56,765 INFO L471 AbstractCegarLoop]: Abstraction has 25708 states and 29175 transitions. [2025-03-08 02:10:56,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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-08 02:10:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 25708 states and 29175 transitions. [2025-03-08 02:10:56,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-08 02:10:56,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:56,770 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:56,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:10:56,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:56,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:56,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1421507702, now seen corresponding path program 1 times [2025-03-08 02:10:56,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:56,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783185730] [2025-03-08 02:10:56,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:56,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:56,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-08 02:10:56,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-08 02:10:56,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:56,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 311 proven. 73 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-08 02:10:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783185730] [2025-03-08 02:10:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783185730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149612778] [2025-03-08 02:10:57,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:57,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:10:57,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:10:57,239 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-08 02:10:57,240 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-08 02:10:57,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-08 02:10:57,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-08 02:10:57,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:57,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:57,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:10:57,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:10:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 311 proven. 73 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-08 02:10:57,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:10:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-08 02:10:57,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149612778] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:57,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:10:57,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:10:57,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390754484] [2025-03-08 02:10:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:57,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:57,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:57,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:57,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:10:57,893 INFO L87 Difference]: Start difference. First operand 25708 states and 29175 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-08 02:11:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:00,010 INFO L93 Difference]: Finished difference Result 62499 states and 71199 transitions. [2025-03-08 02:11:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:00,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 316 [2025-03-08 02:11:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:00,077 INFO L225 Difference]: With dead ends: 62499 [2025-03-08 02:11:00,077 INFO L226 Difference]: Without dead ends: 36366 [2025-03-08 02:11:00,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:11:00,103 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 879 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:00,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 180 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 2306 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 02:11:00,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36366 states. [2025-03-08 02:11:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36366 to 34238. [2025-03-08 02:11:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34238 states, 34237 states have (on average 1.1454566696848438) internal successors, (39217), 34237 states have internal predecessors, (39217), 0 states have call successors, (0), 0 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-08 02:11:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34238 states to 34238 states and 39217 transitions. [2025-03-08 02:11:00,441 INFO L78 Accepts]: Start accepts. Automaton has 34238 states and 39217 transitions. Word has length 316 [2025-03-08 02:11:00,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:00,441 INFO L471 AbstractCegarLoop]: Abstraction has 34238 states and 39217 transitions. [2025-03-08 02:11:00,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-08 02:11:00,441 INFO L276 IsEmpty]: Start isEmpty. Operand 34238 states and 39217 transitions. [2025-03-08 02:11:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-08 02:11:00,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:00,452 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:00,458 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-08 02:11:00,656 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,SelfDestructingSolverStorable8 [2025-03-08 02:11:00,656 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:00,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1151606882, now seen corresponding path program 1 times [2025-03-08 02:11:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:00,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640190069] [2025-03-08 02:11:00,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:00,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:00,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-08 02:11:00,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-08 02:11:00,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:00,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-03-08 02:11:00,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:00,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640190069] [2025-03-08 02:11:00,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640190069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:00,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:00,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:00,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728994256] [2025-03-08 02:11:00,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:00,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:00,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:00,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:00,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:00,903 INFO L87 Difference]: Start difference. First operand 34238 states and 39217 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 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-08 02:11:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:02,298 INFO L93 Difference]: Finished difference Result 80388 states and 92354 transitions. [2025-03-08 02:11:02,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:02,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 439 [2025-03-08 02:11:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:02,353 INFO L225 Difference]: With dead ends: 80388 [2025-03-08 02:11:02,353 INFO L226 Difference]: Without dead ends: 45725 [2025-03-08 02:11:02,379 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-08 02:11:02,380 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:02,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 255 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45725 states. [2025-03-08 02:11:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45725 to 33771. [2025-03-08 02:11:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33771 states, 33770 states have (on average 1.1432928634883033) internal successors, (38609), 33770 states have internal predecessors, (38609), 0 states have call successors, (0), 0 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-08 02:11:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33771 states to 33771 states and 38609 transitions. [2025-03-08 02:11:02,951 INFO L78 Accepts]: Start accepts. Automaton has 33771 states and 38609 transitions. Word has length 439 [2025-03-08 02:11:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:02,951 INFO L471 AbstractCegarLoop]: Abstraction has 33771 states and 38609 transitions. [2025-03-08 02:11:02,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 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-08 02:11:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 33771 states and 38609 transitions. [2025-03-08 02:11:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-08 02:11:02,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:02,960 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:02,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:11:02,960 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:02,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1186931946, now seen corresponding path program 1 times [2025-03-08 02:11:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573189450] [2025-03-08 02:11:02,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:02,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-08 02:11:03,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-08 02:11:03,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:03,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 02:11:03,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:03,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573189450] [2025-03-08 02:11:03,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573189450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:03,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:03,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:03,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545645695] [2025-03-08 02:11:03,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:03,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:03,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:03,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:03,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:03,236 INFO L87 Difference]: Start difference. First operand 33771 states and 38609 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 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-08 02:11:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:04,616 INFO L93 Difference]: Finished difference Result 80766 states and 92383 transitions. [2025-03-08 02:11:04,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:04,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 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 451 [2025-03-08 02:11:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:04,664 INFO L225 Difference]: With dead ends: 80766 [2025-03-08 02:11:04,664 INFO L226 Difference]: Without dead ends: 43595 [2025-03-08 02:11:04,685 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-08 02:11:04,686 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 372 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:04,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 846 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43595 states. [2025-03-08 02:11:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43595 to 38898. [2025-03-08 02:11:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38898 states, 38897 states have (on average 1.1182610484099031) internal successors, (43497), 38897 states have internal predecessors, (43497), 0 states have call successors, (0), 0 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-08 02:11:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38898 states to 38898 states and 43497 transitions. [2025-03-08 02:11:05,184 INFO L78 Accepts]: Start accepts. Automaton has 38898 states and 43497 transitions. Word has length 451 [2025-03-08 02:11:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:05,185 INFO L471 AbstractCegarLoop]: Abstraction has 38898 states and 43497 transitions. [2025-03-08 02:11:05,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 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-08 02:11:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 38898 states and 43497 transitions. [2025-03-08 02:11:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-08 02:11:05,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:05,199 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:05,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:11:05,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:05,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:05,200 INFO L85 PathProgramCache]: Analyzing trace with hash -869689265, now seen corresponding path program 1 times [2025-03-08 02:11:05,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:05,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910856408] [2025-03-08 02:11:05,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:05,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:05,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-08 02:11:05,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-08 02:11:05,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:05,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 300 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:11:06,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:06,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910856408] [2025-03-08 02:11:06,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910856408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:06,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593627510] [2025-03-08 02:11:06,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:06,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:06,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:11:06,077 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-08 02:11:06,079 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-08 02:11:06,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-08 02:11:06,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-08 02:11:06,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:06,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:06,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:11:06,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:11:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 218 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 02:11:06,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:11:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 218 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 02:11:07,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593627510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:11:07,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:11:07,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-08 02:11:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884205002] [2025-03-08 02:11:07,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:11:07,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:11:07,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:07,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:11:07,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:11:07,162 INFO L87 Difference]: Start difference. First operand 38898 states and 43497 transitions. Second operand has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 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-08 02:11:15,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:15,646 INFO L93 Difference]: Finished difference Result 126790 states and 142783 transitions. [2025-03-08 02:11:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 02:11:15,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 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 453 [2025-03-08 02:11:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:15,733 INFO L225 Difference]: With dead ends: 126790 [2025-03-08 02:11:15,733 INFO L226 Difference]: Without dead ends: 85767 [2025-03-08 02:11:15,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 913 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2025-03-08 02:11:15,755 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 8123 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 10244 mSolverCounterSat, 2828 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8123 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 13072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2828 IncrementalHoareTripleChecker+Valid, 10244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:15,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8123 Valid, 364 Invalid, 13072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2828 Valid, 10244 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2025-03-08 02:11:15,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85767 states. [2025-03-08 02:11:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85767 to 76353. [2025-03-08 02:11:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76353 states, 76352 states have (on average 1.120088537300922) internal successors, (85521), 76352 states have internal predecessors, (85521), 0 states have call successors, (0), 0 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-08 02:11:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76353 states to 76353 states and 85521 transitions. [2025-03-08 02:11:16,664 INFO L78 Accepts]: Start accepts. Automaton has 76353 states and 85521 transitions. Word has length 453 [2025-03-08 02:11:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:16,664 INFO L471 AbstractCegarLoop]: Abstraction has 76353 states and 85521 transitions. [2025-03-08 02:11:16,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 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-08 02:11:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 76353 states and 85521 transitions. [2025-03-08 02:11:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 02:11:16,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:16,672 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:16,678 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-08 02:11:16,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:16,873 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:16,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1255388750, now seen corresponding path program 1 times [2025-03-08 02:11:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:16,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969840059] [2025-03-08 02:11:16,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:16,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 02:11:16,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 02:11:16,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:16,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-08 02:11:17,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:17,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969840059] [2025-03-08 02:11:17,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969840059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:17,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:17,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:17,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269138283] [2025-03-08 02:11:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:17,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:17,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:17,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:17,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:17,130 INFO L87 Difference]: Start difference. First operand 76353 states and 85521 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-08 02:11:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:18,807 INFO L93 Difference]: Finished difference Result 168447 states and 188435 transitions. [2025-03-08 02:11:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:18,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 462 [2025-03-08 02:11:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:18,908 INFO L225 Difference]: With dead ends: 168447 [2025-03-08 02:11:18,908 INFO L226 Difference]: Without dead ends: 88269 [2025-03-08 02:11:18,951 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-08 02:11:18,952 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 447 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:18,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 792 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:11:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88269 states. [2025-03-08 02:11:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88269 to 76327. [2025-03-08 02:11:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76327 states, 76326 states have (on average 1.1068574273510992) internal successors, (84482), 76326 states have internal predecessors, (84482), 0 states have call successors, (0), 0 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-08 02:11:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76327 states to 76327 states and 84482 transitions. [2025-03-08 02:11:19,824 INFO L78 Accepts]: Start accepts. Automaton has 76327 states and 84482 transitions. Word has length 462 [2025-03-08 02:11:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:19,825 INFO L471 AbstractCegarLoop]: Abstraction has 76327 states and 84482 transitions. [2025-03-08 02:11:19,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-08 02:11:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 76327 states and 84482 transitions. [2025-03-08 02:11:19,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-08 02:11:19,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:19,831 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:19,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:11:19,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:19,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:19,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1885595799, now seen corresponding path program 1 times [2025-03-08 02:11:19,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:19,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321525043] [2025-03-08 02:11:19,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:19,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:19,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 02:11:19,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 02:11:19,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:19,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 261 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 02:11:20,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:20,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321525043] [2025-03-08 02:11:20,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321525043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:20,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156839881] [2025-03-08 02:11:20,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:20,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:20,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:11:20,802 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-08 02:11:20,807 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-08 02:11:20,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 02:11:21,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 02:11:21,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:21,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:21,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:11:21,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:11:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 47 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:11:22,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:11:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:11:24,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156839881] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:24,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:11:24,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 7 [2025-03-08 02:11:24,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325126785] [2025-03-08 02:11:24,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:24,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:24,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:24,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:24,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:11:24,567 INFO L87 Difference]: Start difference. First operand 76327 states and 84482 transitions. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 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-08 02:11:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:26,409 INFO L93 Difference]: Finished difference Result 164563 states and 181849 transitions. [2025-03-08 02:11:26,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:26,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 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 496 [2025-03-08 02:11:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:26,512 INFO L225 Difference]: With dead ends: 164563 [2025-03-08 02:11:26,512 INFO L226 Difference]: Without dead ends: 88663 [2025-03-08 02:11:26,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 993 GetRequests, 988 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:11:26,562 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 230 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:26,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 205 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:11:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88663 states. [2025-03-08 02:11:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88663 to 79729. [2025-03-08 02:11:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79729 states, 79728 states have (on average 1.1073148705599036) internal successors, (88284), 79728 states have internal predecessors, (88284), 0 states have call successors, (0), 0 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-08 02:11:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79729 states to 79729 states and 88284 transitions. [2025-03-08 02:11:27,472 INFO L78 Accepts]: Start accepts. Automaton has 79729 states and 88284 transitions. Word has length 496 [2025-03-08 02:11:27,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:27,472 INFO L471 AbstractCegarLoop]: Abstraction has 79729 states and 88284 transitions. [2025-03-08 02:11:27,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 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-08 02:11:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 79729 states and 88284 transitions. [2025-03-08 02:11:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-03-08 02:11:27,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:27,483 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:27,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 02:11:27,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:27,683 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:27,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:27,684 INFO L85 PathProgramCache]: Analyzing trace with hash -930046374, now seen corresponding path program 1 times [2025-03-08 02:11:27,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:27,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304603615] [2025-03-08 02:11:27,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:27,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:27,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-03-08 02:11:27,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-03-08 02:11:27,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:27,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:11:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:27,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304603615] [2025-03-08 02:11:27,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304603615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:27,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:27,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:27,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477151858] [2025-03-08 02:11:27,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:27,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:27,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:27,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:27,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:27,933 INFO L87 Difference]: Start difference. First operand 79729 states and 88284 transitions. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-08 02:11:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:29,318 INFO L93 Difference]: Finished difference Result 158171 states and 175203 transitions. [2025-03-08 02:11:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:29,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 585 [2025-03-08 02:11:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:29,399 INFO L225 Difference]: With dead ends: 158171 [2025-03-08 02:11:29,399 INFO L226 Difference]: Without dead ends: 78869 [2025-03-08 02:11:29,447 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-08 02:11:29,448 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 481 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:29,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 719 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:11:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78869 states. [2025-03-08 02:11:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78869 to 77166. [2025-03-08 02:11:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77166 states, 77165 states have (on average 1.0837555886736214) internal successors, (83628), 77165 states have internal predecessors, (83628), 0 states have call successors, (0), 0 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-08 02:11:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77166 states to 77166 states and 83628 transitions. [2025-03-08 02:11:30,297 INFO L78 Accepts]: Start accepts. Automaton has 77166 states and 83628 transitions. Word has length 585 [2025-03-08 02:11:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:30,298 INFO L471 AbstractCegarLoop]: Abstraction has 77166 states and 83628 transitions. [2025-03-08 02:11:30,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-08 02:11:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 77166 states and 83628 transitions. [2025-03-08 02:11:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-08 02:11:30,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:30,311 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:30,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:11:30,311 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:30,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:30,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1668066818, now seen corresponding path program 1 times [2025-03-08 02:11:30,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:30,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396203628] [2025-03-08 02:11:30,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:30,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:30,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-08 02:11:30,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-08 02:11:30,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:30,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-08 02:11:30,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:30,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396203628] [2025-03-08 02:11:30,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396203628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:30,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:30,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:30,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144607319] [2025-03-08 02:11:30,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:30,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:30,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:30,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:30,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:30,475 INFO L87 Difference]: Start difference. First operand 77166 states and 83628 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-08 02:11:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:32,021 INFO L93 Difference]: Finished difference Result 159859 states and 173116 transitions. [2025-03-08 02:11:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:32,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 604 [2025-03-08 02:11:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:32,113 INFO L225 Difference]: With dead ends: 159859 [2025-03-08 02:11:32,113 INFO L226 Difference]: Without dead ends: 80994 [2025-03-08 02:11:32,159 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-08 02:11:32,160 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 495 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:32,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 693 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80994 states. [2025-03-08 02:11:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80994 to 78437. [2025-03-08 02:11:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78437 states, 78436 states have (on average 1.074289866897853) internal successors, (84263), 78436 states have internal predecessors, (84263), 0 states have call successors, (0), 0 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-08 02:11:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78437 states to 78437 states and 84263 transitions. [2025-03-08 02:11:33,257 INFO L78 Accepts]: Start accepts. Automaton has 78437 states and 84263 transitions. Word has length 604 [2025-03-08 02:11:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:33,258 INFO L471 AbstractCegarLoop]: Abstraction has 78437 states and 84263 transitions. [2025-03-08 02:11:33,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-08 02:11:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 78437 states and 84263 transitions. [2025-03-08 02:11:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-03-08 02:11:33,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:33,281 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:33,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:11:33,282 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:33,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:33,282 INFO L85 PathProgramCache]: Analyzing trace with hash 919276566, now seen corresponding path program 1 times [2025-03-08 02:11:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:33,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023186744] [2025-03-08 02:11:33,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:33,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-08 02:11:33,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-08 02:11:33,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:33,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 360 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 02:11:34,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:34,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023186744] [2025-03-08 02:11:34,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023186744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:34,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107338906] [2025-03-08 02:11:34,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:34,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:34,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:11:34,245 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:11:34,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 02:11:34,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-08 02:11:34,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-08 02:11:34,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:34,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:34,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 02:11:34,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:11:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 360 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 02:11:35,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:11:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 360 proven. 82 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 02:11:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107338906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:11:38,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:11:38,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-08 02:11:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715376750] [2025-03-08 02:11:38,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:11:38,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 02:11:38,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:38,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 02:11:38,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:11:38,456 INFO L87 Difference]: Start difference. First operand 78437 states and 84263 transitions. Second operand has 8 states, 8 states have (on average 180.125) internal successors, (1441), 7 states have internal predecessors, (1441), 0 states have call successors, (0), 0 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-08 02:11:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:43,523 INFO L93 Difference]: Finished difference Result 173468 states and 186118 transitions. [2025-03-08 02:11:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 02:11:43,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 180.125) internal successors, (1441), 7 states have internal predecessors, (1441), 0 states have call successors, (0), 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 662 [2025-03-08 02:11:43,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:43,624 INFO L225 Difference]: With dead ends: 173468 [2025-03-08 02:11:43,624 INFO L226 Difference]: Without dead ends: 95458 [2025-03-08 02:11:43,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1326 GetRequests, 1319 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:11:43,655 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1754 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 5871 mSolverCounterSat, 1142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 7013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1142 IncrementalHoareTripleChecker+Valid, 5871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:43,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 349 Invalid, 7013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1142 Valid, 5871 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 02:11:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95458 states. [2025-03-08 02:11:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95458 to 86507. [2025-03-08 02:11:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86507 states, 86506 states have (on average 1.068920074908099) internal successors, (92468), 86506 states have internal predecessors, (92468), 0 states have call successors, (0), 0 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-08 02:11:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86507 states to 86507 states and 92468 transitions. [2025-03-08 02:11:44,432 INFO L78 Accepts]: Start accepts. Automaton has 86507 states and 92468 transitions. Word has length 662 [2025-03-08 02:11:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:44,432 INFO L471 AbstractCegarLoop]: Abstraction has 86507 states and 92468 transitions. [2025-03-08 02:11:44,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 180.125) internal successors, (1441), 7 states have internal predecessors, (1441), 0 states have call successors, (0), 0 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-08 02:11:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 86507 states and 92468 transitions. [2025-03-08 02:11:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-03-08 02:11:44,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:44,444 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:11:44,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 02:11:44,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 02:11:44,644 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:44,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:44,645 INFO L85 PathProgramCache]: Analyzing trace with hash 918897944, now seen corresponding path program 1 times [2025-03-08 02:11:44,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:44,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028024188] [2025-03-08 02:11:44,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:44,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:44,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-08 02:11:44,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-08 02:11:44,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:44,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:11:45,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:45,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028024188] [2025-03-08 02:11:45,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028024188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:45,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:45,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:45,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687310923] [2025-03-08 02:11:45,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:45,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:45,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:45,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:45,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:45,244 INFO L87 Difference]: Start difference. First operand 86507 states and 92468 transitions. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-08 02:11:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:46,740 INFO L93 Difference]: Finished difference Result 180245 states and 192615 transitions. [2025-03-08 02:11:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 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 671 [2025-03-08 02:11:46,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:46,853 INFO L225 Difference]: With dead ends: 180245 [2025-03-08 02:11:46,854 INFO L226 Difference]: Without dead ends: 94165 [2025-03-08 02:11:46,904 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-08 02:11:46,904 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 225 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:46,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 339 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:11:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94165 states. [2025-03-08 02:11:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94165 to 90332. [2025-03-08 02:11:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90332 states, 90331 states have (on average 1.0655921001649489) internal successors, (96256), 90331 states have internal predecessors, (96256), 0 states have call successors, (0), 0 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-08 02:11:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90332 states to 90332 states and 96256 transitions. [2025-03-08 02:11:48,184 INFO L78 Accepts]: Start accepts. Automaton has 90332 states and 96256 transitions. Word has length 671 [2025-03-08 02:11:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:48,184 INFO L471 AbstractCegarLoop]: Abstraction has 90332 states and 96256 transitions. [2025-03-08 02:11:48,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-08 02:11:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 90332 states and 96256 transitions. [2025-03-08 02:11:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-03-08 02:11:48,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:48,203 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:11:48,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:11:48,204 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:48,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:48,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1253501152, now seen corresponding path program 1 times [2025-03-08 02:11:48,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:48,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726772917] [2025-03-08 02:11:48,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:48,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:48,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-03-08 02:11:48,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-03-08 02:11:48,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:48,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:11:48,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:48,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726772917] [2025-03-08 02:11:48,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726772917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:48,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:48,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:48,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159210248] [2025-03-08 02:11:48,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:48,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:48,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:48,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:48,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:48,783 INFO L87 Difference]: Start difference. First operand 90332 states and 96256 transitions. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 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-08 02:11:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:51,444 INFO L93 Difference]: Finished difference Result 200267 states and 213088 transitions. [2025-03-08 02:11:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:51,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 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 679 [2025-03-08 02:11:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:51,588 INFO L225 Difference]: With dead ends: 200267 [2025-03-08 02:11:51,588 INFO L226 Difference]: Without dead ends: 106958 [2025-03-08 02:11:51,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:51,652 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 680 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2517 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:51,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 263 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2517 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:11:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106958 states. [2025-03-08 02:11:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106958 to 99271. [2025-03-08 02:11:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99271 states, 99270 states have (on average 1.0656794600584265) internal successors, (105790), 99270 states have internal predecessors, (105790), 0 states have call successors, (0), 0 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-08 02:11:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99271 states to 99271 states and 105790 transitions. [2025-03-08 02:11:52,994 INFO L78 Accepts]: Start accepts. Automaton has 99271 states and 105790 transitions. Word has length 679 [2025-03-08 02:11:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:52,995 INFO L471 AbstractCegarLoop]: Abstraction has 99271 states and 105790 transitions. [2025-03-08 02:11:52,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 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-08 02:11:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 99271 states and 105790 transitions. [2025-03-08 02:11:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-03-08 02:11:53,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:53,010 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:53,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:11:53,011 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:53,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash 610099675, now seen corresponding path program 1 times [2025-03-08 02:11:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:53,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171243416] [2025-03-08 02:11:53,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:53,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-03-08 02:11:53,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-03-08 02:11:53,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:53,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-08 02:11:53,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:53,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171243416] [2025-03-08 02:11:53,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171243416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:53,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:53,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:53,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913033677] [2025-03-08 02:11:53,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:53,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:53,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:53,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:53,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:53,481 INFO L87 Difference]: Start difference. First operand 99271 states and 105790 transitions. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 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-08 02:11:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:55,131 INFO L93 Difference]: Finished difference Result 201515 states and 214659 transitions. [2025-03-08 02:11:55,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:55,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 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 684 [2025-03-08 02:11:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:55,245 INFO L225 Difference]: With dead ends: 201515 [2025-03-08 02:11:55,245 INFO L226 Difference]: Without dead ends: 102246 [2025-03-08 02:11:55,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:55,300 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 826 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:55,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 733 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102246 states. [2025-03-08 02:11:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102246 to 101396. [2025-03-08 02:11:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101396 states, 101395 states have (on average 1.0646876078702106) internal successors, (107954), 101395 states have internal predecessors, (107954), 0 states have call successors, (0), 0 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-08 02:11:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101396 states to 101396 states and 107954 transitions. [2025-03-08 02:11:56,476 INFO L78 Accepts]: Start accepts. Automaton has 101396 states and 107954 transitions. Word has length 684 [2025-03-08 02:11:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:56,476 INFO L471 AbstractCegarLoop]: Abstraction has 101396 states and 107954 transitions. [2025-03-08 02:11:56,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 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-08 02:11:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 101396 states and 107954 transitions.