./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/Problem18_label02.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 7374a19a36503b007cd18295c1c04322cbbf1ddc2601cba91afd74d86d0833b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:03:17,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:03:17,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:03:17,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:03:17,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:03:17,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:03:17,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:03:17,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:03:17,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:03:17,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:03:17,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:03:17,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:03:17,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:03:17,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:03:17,108 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:03:17,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:03:17,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:03:17,109 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:03:17,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:03:17,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:03:17,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:03:17,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:03:17,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:03:17,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:03:17,109 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:03:17,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:03:17,109 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:03:17,110 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:03:17,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:03:17,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:03:17,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:03:17,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:03:17,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:03:17,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:03:17,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:03:17,110 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:03:17,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:03:17,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:03:17,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:03:17,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:03:17,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:03:17,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:03:17,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:03:17,111 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 -> 7374a19a36503b007cd18295c1c04322cbbf1ddc2601cba91afd74d86d0833b2 [2025-03-03 11:03:17,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:03:17,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:03:17,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:03:17,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:03:17,332 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:03:17,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label02.c [2025-03-03 11:03:18,415 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00f7e5008/e75c643bdd674f699aaa0b55738646c4/FLAG4efb70fff [2025-03-03 11:03:18,826 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:03:18,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label02.c [2025-03-03 11:03:18,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00f7e5008/e75c643bdd674f699aaa0b55738646c4/FLAG4efb70fff [2025-03-03 11:03:18,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00f7e5008/e75c643bdd674f699aaa0b55738646c4 [2025-03-03 11:03:18,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:03:18,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:03:18,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:03:18,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:03:18,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:03:18,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:03:18" (1/1) ... [2025-03-03 11:03:18,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ab969f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:18, skipping insertion in model container [2025-03-03 11:03:18,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:03:18" (1/1) ... [2025-03-03 11:03:19,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:03:19,194 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/Problem18_label02.c[6350,6363] [2025-03-03 11:03:19,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:03:19,587 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:03:19,604 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/Problem18_label02.c[6350,6363] [2025-03-03 11:03:19,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:03:19,817 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:03:19,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19 WrapperNode [2025-03-03 11:03:19,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:03:19,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:03:19,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:03:19,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:03:19,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:19,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:20,019 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-03 11:03:20,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:03:20,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:03:20,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:03:20,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:03:20,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:20,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:20,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:20,112 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-03 11:03:20,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:20,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:20,173 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:20,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:20,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:20,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:20,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:03:20,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:03:20,268 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:03:20,268 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:03:20,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (1/1) ... [2025-03-03 11:03:20,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:03:20,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:20,295 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-03 11:03:20,301 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-03 11:03:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:03:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:03:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:03:20,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:03:20,359 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:03:20,361 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:03:23,055 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-03 11:03:23,055 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-03 11:03:23,171 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-03 11:03:23,171 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:03:23,202 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:03:23,202 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:03:23,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:23 BoogieIcfgContainer [2025-03-03 11:03:23,202 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:03:23,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:03:23,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:03:23,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:03:23,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:03:18" (1/3) ... [2025-03-03 11:03:23,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b06609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:03:23, skipping insertion in model container [2025-03-03 11:03:23,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:03:19" (2/3) ... [2025-03-03 11:03:23,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b06609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:03:23, skipping insertion in model container [2025-03-03 11:03:23,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:23" (3/3) ... [2025-03-03 11:03:23,209 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label02.c [2025-03-03 11:03:23,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:03:23,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label02.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:03:23,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:03:23,283 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;@11d2a7db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:03:23,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:03:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 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-03 11:03:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 11:03:23,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:23,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:23,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1521381861, now seen corresponding path program 1 times [2025-03-03 11:03:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:23,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360357059] [2025-03-03 11:03:23,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:23,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 11:03:23,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 11:03:23,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:23,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:23,604 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-03 11:03:23,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:23,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360357059] [2025-03-03 11:03:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360357059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:23,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:03:23,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565059374] [2025-03-03 11:03:23,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:23,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:23,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:23,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:23,626 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 11:03:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:25,985 INFO L93 Difference]: Finished difference Result 2205 states and 4263 transitions. [2025-03-03 11:03:25,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:25,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 11:03:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:25,998 INFO L225 Difference]: With dead ends: 2205 [2025-03-03 11:03:25,998 INFO L226 Difference]: Without dead ends: 1384 [2025-03-03 11:03:26,002 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-03 11:03:26,003 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 687 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 967 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 967 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:26,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 291 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [967 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 11:03:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-03 11:03:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-03-03 11:03:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.7339117859725235) internal successors, (2398), 1383 states have internal predecessors, (2398), 0 states have call successors, (0), 0 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-03 11:03:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2398 transitions. [2025-03-03 11:03:26,086 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2398 transitions. Word has length 61 [2025-03-03 11:03:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:26,086 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2398 transitions. [2025-03-03 11:03:26,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 11:03:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2398 transitions. [2025-03-03 11:03:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 11:03:26,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:26,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:03:26,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:03:26,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:26,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:26,092 INFO L85 PathProgramCache]: Analyzing trace with hash -793770819, now seen corresponding path program 1 times [2025-03-03 11:03:26,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:26,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530481326] [2025-03-03 11:03:26,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:26,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 11:03:26,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 11:03:26,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:26,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:26,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530481326] [2025-03-03 11:03:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530481326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:26,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:03:26,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846956660] [2025-03-03 11:03:26,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:26,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:26,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:26,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:26,294 INFO L87 Difference]: Start difference. First operand 1384 states and 2398 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-03 11:03:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:28,374 INFO L93 Difference]: Finished difference Result 4146 states and 7189 transitions. [2025-03-03 11:03:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:28,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-03 11:03:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:28,384 INFO L225 Difference]: With dead ends: 4146 [2025-03-03 11:03:28,384 INFO L226 Difference]: Without dead ends: 2764 [2025-03-03 11:03:28,386 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-03 11:03:28,387 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 676 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:28,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 573 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 11:03:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-03-03 11:03:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2025-03-03 11:03:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.430691277596815) internal successors, (3953), 2763 states have internal predecessors, (3953), 0 states have call successors, (0), 0 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-03 11:03:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3953 transitions. [2025-03-03 11:03:28,429 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3953 transitions. Word has length 130 [2025-03-03 11:03:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:28,429 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3953 transitions. [2025-03-03 11:03:28,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-03 11:03:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3953 transitions. [2025-03-03 11:03:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 11:03:28,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:28,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:03:28,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:03:28,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:28,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:28,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1559338267, now seen corresponding path program 1 times [2025-03-03 11:03:28,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:28,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110130969] [2025-03-03 11:03:28,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:28,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:28,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 11:03:28,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 11:03:28,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:28,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:28,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:28,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110130969] [2025-03-03 11:03:28,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110130969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:28,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:28,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:03:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398747275] [2025-03-03 11:03:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:28,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:28,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:28,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:28,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:28,606 INFO L87 Difference]: Start difference. First operand 2764 states and 3953 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:30,564 INFO L93 Difference]: Finished difference Result 8288 states and 11855 transitions. [2025-03-03 11:03:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:30,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-03-03 11:03:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:30,578 INFO L225 Difference]: With dead ends: 8288 [2025-03-03 11:03:30,581 INFO L226 Difference]: Without dead ends: 5526 [2025-03-03 11:03:30,585 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-03 11:03:30,586 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 691 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:30,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 434 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 11:03:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2025-03-03 11:03:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5524. [2025-03-03 11:03:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.2820930653630274) internal successors, (7081), 5523 states have internal predecessors, (7081), 0 states have call successors, (0), 0 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-03 11:03:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 7081 transitions. [2025-03-03 11:03:30,665 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 7081 transitions. Word has length 146 [2025-03-03 11:03:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:30,665 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 7081 transitions. [2025-03-03 11:03:30,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 7081 transitions. [2025-03-03 11:03:30,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 11:03:30,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:30,668 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:03:30,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:03:30,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:30,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:30,669 INFO L85 PathProgramCache]: Analyzing trace with hash -516202958, now seen corresponding path program 1 times [2025-03-03 11:03:30,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:30,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800057454] [2025-03-03 11:03:30,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:30,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:30,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 11:03:30,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 11:03:30,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:30,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:31,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800057454] [2025-03-03 11:03:31,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800057454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:31,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:31,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:31,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612058284] [2025-03-03 11:03:31,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:31,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:31,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:31,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:31,100 INFO L87 Difference]: Start difference. First operand 5524 states and 7081 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 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-03 11:03:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:33,719 INFO L93 Difference]: Finished difference Result 15188 states and 18712 transitions. [2025-03-03 11:03:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:33,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2025-03-03 11:03:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:33,739 INFO L225 Difference]: With dead ends: 15188 [2025-03-03 11:03:33,740 INFO L226 Difference]: Without dead ends: 9666 [2025-03-03 11:03:33,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:03:33,744 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 1875 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4380 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 4380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:33,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 649 Invalid, 4486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 4380 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 11:03:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2025-03-03 11:03:33,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 8974. [2025-03-03 11:03:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8973 states have (on average 1.2006018054162488) internal successors, (10773), 8973 states have internal predecessors, (10773), 0 states have call successors, (0), 0 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-03 11:03:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 10773 transitions. [2025-03-03 11:03:33,852 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 10773 transitions. Word has length 179 [2025-03-03 11:03:33,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:33,852 INFO L471 AbstractCegarLoop]: Abstraction has 8974 states and 10773 transitions. [2025-03-03 11:03:33,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 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-03 11:03:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 10773 transitions. [2025-03-03 11:03:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-03 11:03:33,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:33,856 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:03:33,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:03:33,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:33,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:33,856 INFO L85 PathProgramCache]: Analyzing trace with hash 542864223, now seen corresponding path program 1 times [2025-03-03 11:03:33,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:33,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699778147] [2025-03-03 11:03:33,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:33,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:33,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-03 11:03:33,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-03 11:03:33,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:33,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 11:03:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699778147] [2025-03-03 11:03:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699778147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:34,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:34,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:34,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053141301] [2025-03-03 11:03:34,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:34,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:34,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:34,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:34,220 INFO L87 Difference]: Start difference. First operand 8974 states and 10773 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-03 11:03:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:35,981 INFO L93 Difference]: Finished difference Result 20761 states and 24426 transitions. [2025-03-03 11:03:35,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:35,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 361 [2025-03-03 11:03:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:36,007 INFO L225 Difference]: With dead ends: 20761 [2025-03-03 11:03:36,009 INFO L226 Difference]: Without dead ends: 11736 [2025-03-03 11:03:36,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-03 11:03:36,017 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 515 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3039 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:36,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 639 Invalid, 3241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3039 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:03:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11736 states. [2025-03-03 11:03:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11736 to 11734. [2025-03-03 11:03:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11734 states, 11733 states have (on average 1.1211113952100913) internal successors, (13154), 11733 states have internal predecessors, (13154), 0 states have call successors, (0), 0 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-03 11:03:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11734 states to 11734 states and 13154 transitions. [2025-03-03 11:03:36,183 INFO L78 Accepts]: Start accepts. Automaton has 11734 states and 13154 transitions. Word has length 361 [2025-03-03 11:03:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:36,183 INFO L471 AbstractCegarLoop]: Abstraction has 11734 states and 13154 transitions. [2025-03-03 11:03:36,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-03 11:03:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 11734 states and 13154 transitions. [2025-03-03 11:03:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2025-03-03 11:03:36,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:36,199 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:03:36,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:03:36,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:36,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash 140963661, now seen corresponding path program 1 times [2025-03-03 11:03:36,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:36,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444355076] [2025-03-03 11:03:36,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:36,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 875 statements into 1 equivalence classes. [2025-03-03 11:03:36,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 875 of 875 statements. [2025-03-03 11:03:36,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:36,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-03 11:03:36,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:36,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444355076] [2025-03-03 11:03:36,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444355076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:36,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:36,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:36,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825903364] [2025-03-03 11:03:36,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:36,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:36,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:36,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:36,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:36,760 INFO L87 Difference]: Start difference. First operand 11734 states and 13154 transitions. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-03 11:03:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:38,481 INFO L93 Difference]: Finished difference Result 27606 states and 31304 transitions. [2025-03-03 11:03:38,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:38,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 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 875 [2025-03-03 11:03:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:38,506 INFO L225 Difference]: With dead ends: 27606 [2025-03-03 11:03:38,506 INFO L226 Difference]: Without dead ends: 15874 [2025-03-03 11:03:38,513 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-03 11:03:38,515 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 641 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:38,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 319 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:03:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15874 states. [2025-03-03 11:03:38,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15874 to 14494. [2025-03-03 11:03:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14494 states, 14493 states have (on average 1.145380528531015) internal successors, (16600), 14493 states have internal predecessors, (16600), 0 states have call successors, (0), 0 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-03 11:03:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 16600 transitions. [2025-03-03 11:03:38,659 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 16600 transitions. Word has length 875 [2025-03-03 11:03:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:38,659 INFO L471 AbstractCegarLoop]: Abstraction has 14494 states and 16600 transitions. [2025-03-03 11:03:38,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-03 11:03:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 16600 transitions. [2025-03-03 11:03:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2025-03-03 11:03:38,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:38,675 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:03:38,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:03:38,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:38,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:38,676 INFO L85 PathProgramCache]: Analyzing trace with hash -10414467, now seen corresponding path program 1 times [2025-03-03 11:03:38,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:38,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127379659] [2025-03-03 11:03:38,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:38,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:38,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 960 statements into 1 equivalence classes. [2025-03-03 11:03:38,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 960 of 960 statements. [2025-03-03 11:03:38,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:38,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-03-03 11:03:39,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:39,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127379659] [2025-03-03 11:03:39,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127379659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:39,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:39,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:03:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011243105] [2025-03-03 11:03:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:39,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:39,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:39,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:39,315 INFO L87 Difference]: Start difference. First operand 14494 states and 16600 transitions. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 2 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-03 11:03:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:41,026 INFO L93 Difference]: Finished difference Result 35886 states and 41754 transitions. [2025-03-03 11:03:41,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:41,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 2 states have internal predecessors, (579), 0 states have call successors, (0), 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 960 [2025-03-03 11:03:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:41,072 INFO L225 Difference]: With dead ends: 35886 [2025-03-03 11:03:41,072 INFO L226 Difference]: Without dead ends: 21394 [2025-03-03 11:03:41,086 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-03 11:03:41,087 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:41,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 82 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:03:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21394 states. [2025-03-03 11:03:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21394 to 21394. [2025-03-03 11:03:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21394 states, 21393 states have (on average 1.1632777076613845) internal successors, (24886), 21393 states have internal predecessors, (24886), 0 states have call successors, (0), 0 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-03 11:03:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21394 states to 21394 states and 24886 transitions. [2025-03-03 11:03:41,314 INFO L78 Accepts]: Start accepts. Automaton has 21394 states and 24886 transitions. Word has length 960 [2025-03-03 11:03:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:41,315 INFO L471 AbstractCegarLoop]: Abstraction has 21394 states and 24886 transitions. [2025-03-03 11:03:41,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 2 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-03 11:03:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 21394 states and 24886 transitions. [2025-03-03 11:03:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2025-03-03 11:03:41,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:41,321 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:03:41,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:03:41,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:41,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash -471397558, now seen corresponding path program 1 times [2025-03-03 11:03:41,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:41,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852896670] [2025-03-03 11:03:41,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:41,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:41,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 961 statements into 1 equivalence classes. [2025-03-03 11:03:41,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 961 of 961 statements. [2025-03-03 11:03:41,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:41,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-03 11:03:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:41,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852896670] [2025-03-03 11:03:41,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852896670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:41,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:41,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:41,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255616658] [2025-03-03 11:03:41,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:41,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:41,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:41,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:41,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:41,792 INFO L87 Difference]: Start difference. First operand 21394 states and 24886 transitions. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-03 11:03:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:43,424 INFO L93 Difference]: Finished difference Result 46926 states and 54727 transitions. [2025-03-03 11:03:43,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:43,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 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 961 [2025-03-03 11:03:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:43,459 INFO L225 Difference]: With dead ends: 46926 [2025-03-03 11:03:43,459 INFO L226 Difference]: Without dead ends: 25534 [2025-03-03 11:03:43,476 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-03 11:03:43,476 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 632 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:43,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1131 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:03:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25534 states. [2025-03-03 11:03:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25534 to 25534. [2025-03-03 11:03:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25534 states, 25533 states have (on average 1.1473779031057847) internal successors, (29296), 25533 states have internal predecessors, (29296), 0 states have call successors, (0), 0 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-03 11:03:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25534 states to 25534 states and 29296 transitions. [2025-03-03 11:03:43,693 INFO L78 Accepts]: Start accepts. Automaton has 25534 states and 29296 transitions. Word has length 961 [2025-03-03 11:03:43,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:43,694 INFO L471 AbstractCegarLoop]: Abstraction has 25534 states and 29296 transitions. [2025-03-03 11:03:43,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-03 11:03:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 25534 states and 29296 transitions. [2025-03-03 11:03:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2025-03-03 11:03:43,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:43,703 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:03:43,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:03:43,703 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:43,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash 104270836, now seen corresponding path program 1 times [2025-03-03 11:03:43,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:43,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430358438] [2025-03-03 11:03:43,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:43,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:43,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 982 statements into 1 equivalence classes. [2025-03-03 11:03:43,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 982 of 982 statements. [2025-03-03 11:03:43,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:43,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-03 11:03:44,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:44,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430358438] [2025-03-03 11:03:44,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430358438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:44,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:44,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154410379] [2025-03-03 11:03:44,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:44,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:44,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:44,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:44,500 INFO L87 Difference]: Start difference. First operand 25534 states and 29296 transitions. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 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-03 11:03:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:45,958 INFO L93 Difference]: Finished difference Result 51756 states and 59283 transitions. [2025-03-03 11:03:45,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:45,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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 982 [2025-03-03 11:03:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:45,990 INFO L225 Difference]: With dead ends: 51756 [2025-03-03 11:03:45,990 INFO L226 Difference]: Without dead ends: 26224 [2025-03-03 11:03:46,008 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-03 11:03:46,008 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 586 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:46,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 981 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:03:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26224 states. [2025-03-03 11:03:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26224 to 26224. [2025-03-03 11:03:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26224 states, 26223 states have (on average 1.1200472867330207) internal successors, (29371), 26223 states have internal predecessors, (29371), 0 states have call successors, (0), 0 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-03 11:03:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26224 states to 26224 states and 29371 transitions. [2025-03-03 11:03:46,256 INFO L78 Accepts]: Start accepts. Automaton has 26224 states and 29371 transitions. Word has length 982 [2025-03-03 11:03:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:46,257 INFO L471 AbstractCegarLoop]: Abstraction has 26224 states and 29371 transitions. [2025-03-03 11:03:46,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 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-03 11:03:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 26224 states and 29371 transitions. [2025-03-03 11:03:46,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2025-03-03 11:03:46,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:46,263 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:03:46,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 11:03:46,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:46,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1049857677, now seen corresponding path program 1 times [2025-03-03 11:03:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:46,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897729929] [2025-03-03 11:03:46,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:46,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 989 statements into 1 equivalence classes. [2025-03-03 11:03:46,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 989 of 989 statements. [2025-03-03 11:03:46,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:46,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-03 11:03:46,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:46,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897729929] [2025-03-03 11:03:46,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897729929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:46,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:46,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:46,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933002905] [2025-03-03 11:03:46,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:46,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:46,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:46,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:46,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:46,899 INFO L87 Difference]: Start difference. First operand 26224 states and 29371 transitions. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 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-03 11:03:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:48,294 INFO L93 Difference]: Finished difference Result 55206 states and 61919 transitions. [2025-03-03 11:03:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:48,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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 989 [2025-03-03 11:03:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:48,325 INFO L225 Difference]: With dead ends: 55206 [2025-03-03 11:03:48,326 INFO L226 Difference]: Without dead ends: 28984 [2025-03-03 11:03:48,344 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-03 11:03:48,345 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 587 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:48,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 380 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:03:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28984 states. [2025-03-03 11:03:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28984 to 28984. [2025-03-03 11:03:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28984 states, 28983 states have (on average 1.1181727219404478) internal successors, (32408), 28983 states have internal predecessors, (32408), 0 states have call successors, (0), 0 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-03 11:03:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28984 states to 28984 states and 32408 transitions. [2025-03-03 11:03:48,615 INFO L78 Accepts]: Start accepts. Automaton has 28984 states and 32408 transitions. Word has length 989 [2025-03-03 11:03:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:48,615 INFO L471 AbstractCegarLoop]: Abstraction has 28984 states and 32408 transitions. [2025-03-03 11:03:48,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 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-03 11:03:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 28984 states and 32408 transitions. [2025-03-03 11:03:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1069 [2025-03-03 11:03:48,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:48,622 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:03:48,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:03:48,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:48,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash 562535383, now seen corresponding path program 1 times [2025-03-03 11:03:48,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:48,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666832208] [2025-03-03 11:03:48,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:48,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:48,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1068 statements into 1 equivalence classes. [2025-03-03 11:03:48,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1068 of 1068 statements. [2025-03-03 11:03:48,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:48,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 534 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-03 11:03:49,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:49,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666832208] [2025-03-03 11:03:49,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666832208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:49,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:49,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711555103] [2025-03-03 11:03:49,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:49,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:49,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:49,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:49,156 INFO L87 Difference]: Start difference. First operand 28984 states and 32408 transitions. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 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-03 11:03:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:50,833 INFO L93 Difference]: Finished difference Result 57276 states and 64119 transitions. [2025-03-03 11:03:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:50,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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 1068 [2025-03-03 11:03:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:50,866 INFO L225 Difference]: With dead ends: 57276 [2025-03-03 11:03:50,867 INFO L226 Difference]: Without dead ends: 28294 [2025-03-03 11:03:50,889 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-03 11:03:50,889 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 587 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:50,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1091 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:03:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28294 states. [2025-03-03 11:03:51,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28294 to 28294. [2025-03-03 11:03:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28294 states, 28293 states have (on average 1.0854274908988089) internal successors, (30710), 28293 states have internal predecessors, (30710), 0 states have call successors, (0), 0 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-03 11:03:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28294 states to 28294 states and 30710 transitions. [2025-03-03 11:03:51,112 INFO L78 Accepts]: Start accepts. Automaton has 28294 states and 30710 transitions. Word has length 1068 [2025-03-03 11:03:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:51,112 INFO L471 AbstractCegarLoop]: Abstraction has 28294 states and 30710 transitions. [2025-03-03 11:03:51,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 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-03 11:03:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 28294 states and 30710 transitions. [2025-03-03 11:03:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1071 [2025-03-03 11:03:51,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:51,120 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:03:51,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:03:51,120 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:51,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash -183096560, now seen corresponding path program 1 times [2025-03-03 11:03:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636880040] [2025-03-03 11:03:51,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:51,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1070 statements into 1 equivalence classes. [2025-03-03 11:03:51,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1070 of 1070 statements. [2025-03-03 11:03:51,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:51,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-03 11:03:51,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:51,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636880040] [2025-03-03 11:03:51,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636880040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:51,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:51,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:51,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280285277] [2025-03-03 11:03:51,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:51,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:51,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:51,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:51,574 INFO L87 Difference]: Start difference. First operand 28294 states and 30710 transitions. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 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-03 11:03:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:53,063 INFO L93 Difference]: Finished difference Result 66936 states and 73309 transitions. [2025-03-03 11:03:53,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:53,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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 1070 [2025-03-03 11:03:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:53,097 INFO L225 Difference]: With dead ends: 66936 [2025-03-03 11:03:53,097 INFO L226 Difference]: Without dead ends: 33124 [2025-03-03 11:03:53,117 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-03 11:03:53,118 INFO L435 NwaCegarLoop]: 1090 mSDtfsCounter, 639 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:53,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1096 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:03:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33124 states. [2025-03-03 11:03:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33124 to 32434. [2025-03-03 11:03:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32434 states, 32433 states have (on average 1.0481299910584898) internal successors, (33994), 32433 states have internal predecessors, (33994), 0 states have call successors, (0), 0 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-03 11:03:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32434 states to 32434 states and 33994 transitions. [2025-03-03 11:03:53,446 INFO L78 Accepts]: Start accepts. Automaton has 32434 states and 33994 transitions. Word has length 1070 [2025-03-03 11:03:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:53,446 INFO L471 AbstractCegarLoop]: Abstraction has 32434 states and 33994 transitions. [2025-03-03 11:03:53,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 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-03 11:03:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32434 states and 33994 transitions. [2025-03-03 11:03:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1150 [2025-03-03 11:03:53,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:53,460 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:03:53,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 11:03:53,460 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:53,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:53,460 INFO L85 PathProgramCache]: Analyzing trace with hash 141190636, now seen corresponding path program 1 times [2025-03-03 11:03:53,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:53,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762999224] [2025-03-03 11:03:53,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:53,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1149 statements into 1 equivalence classes. [2025-03-03 11:03:53,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1149 of 1149 statements. [2025-03-03 11:03:53,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:53,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1391 backedges. 655 proven. 650 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-03 11:03:54,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:54,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762999224] [2025-03-03 11:03:54,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762999224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:54,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539306023] [2025-03-03 11:03:54,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:54,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:54,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:54,598 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-03 11:03:54,600 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-03 11:03:54,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1149 statements into 1 equivalence classes. [2025-03-03 11:03:54,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1149 of 1149 statements. [2025-03-03 11:03:54,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:54,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:54,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 1335 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:03:54,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:03:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1391 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-03-03 11:03:54,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:03:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539306023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:54,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:03:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 11:03:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052537810] [2025-03-03 11:03:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:54,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:54,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:54,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:03:54,989 INFO L87 Difference]: Start difference. First operand 32434 states and 33994 transitions. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 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-03 11:03:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:56,468 INFO L93 Difference]: Finished difference Result 75216 states and 79459 transitions. [2025-03-03 11:03:56,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:56,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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 1149 [2025-03-03 11:03:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:56,509 INFO L225 Difference]: With dead ends: 75216 [2025-03-03 11:03:56,509 INFO L226 Difference]: Without dead ends: 42784 [2025-03-03 11:03:56,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1156 GetRequests, 1149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:03:56,533 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 654 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:56,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 164 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1745 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:03:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42784 states. [2025-03-03 11:03:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42784 to 42784. [2025-03-03 11:03:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42784 states, 42783 states have (on average 1.0504172217937031) internal successors, (44940), 42783 states have internal predecessors, (44940), 0 states have call successors, (0), 0 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-03 11:03:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42784 states to 42784 states and 44940 transitions. [2025-03-03 11:03:56,979 INFO L78 Accepts]: Start accepts. Automaton has 42784 states and 44940 transitions. Word has length 1149 [2025-03-03 11:03:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:56,980 INFO L471 AbstractCegarLoop]: Abstraction has 42784 states and 44940 transitions. [2025-03-03 11:03:56,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 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-03 11:03:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 42784 states and 44940 transitions. [2025-03-03 11:03:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1189 [2025-03-03 11:03:56,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:56,997 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:03:57,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 11:03:57,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 11:03:57,198 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:57,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash 740834327, now seen corresponding path program 1 times [2025-03-03 11:03:57,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:57,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279983945] [2025-03-03 11:03:57,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:57,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1188 statements into 1 equivalence classes. [2025-03-03 11:03:57,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1188 of 1188 statements. [2025-03-03 11:03:57,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:57,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 905 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-03 11:03:58,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:58,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279983945] [2025-03-03 11:03:58,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279983945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:58,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:58,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700480462] [2025-03-03 11:03:58,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:58,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:58,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:58,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:58,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:58,249 INFO L87 Difference]: Start difference. First operand 42784 states and 44940 transitions. Second operand has 4 states, 4 states have (on average 206.75) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 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-03 11:03:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:59,972 INFO L93 Difference]: Finished difference Result 85566 states and 89878 transitions. [2025-03-03 11:03:59,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:59,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 206.75) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 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 1188 [2025-03-03 11:03:59,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:00,014 INFO L225 Difference]: With dead ends: 85566 [2025-03-03 11:04:00,017 INFO L226 Difference]: Without dead ends: 42784 [2025-03-03 11:04:00,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-03 11:04:00,054 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 990 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2664 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:00,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 69 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 2664 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:04:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42784 states. [2025-03-03 11:04:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42784 to 42784. [2025-03-03 11:04:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42784 states, 42783 states have (on average 1.0501834840941495) internal successors, (44930), 42783 states have internal predecessors, (44930), 0 states have call successors, (0), 0 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-03 11:04:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42784 states to 42784 states and 44930 transitions. [2025-03-03 11:04:00,368 INFO L78 Accepts]: Start accepts. Automaton has 42784 states and 44930 transitions. Word has length 1188 [2025-03-03 11:04:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:00,369 INFO L471 AbstractCegarLoop]: Abstraction has 42784 states and 44930 transitions. [2025-03-03 11:04:00,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 206.75) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 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-03 11:04:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 42784 states and 44930 transitions. [2025-03-03 11:04:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1220 [2025-03-03 11:04:00,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:00,379 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:04:00,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 11:04:00,379 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:00,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash 712692923, now seen corresponding path program 1 times [2025-03-03 11:04:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:00,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781665957] [2025-03-03 11:04:00,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:00,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1219 statements into 1 equivalence classes. [2025-03-03 11:04:00,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1219 of 1219 statements. [2025-03-03 11:04:00,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:00,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2025-03-03 11:04:00,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:00,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781665957] [2025-03-03 11:04:00,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781665957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:00,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:00,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:00,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419448371] [2025-03-03 11:04:00,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:00,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:00,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:00,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:00,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:00,787 INFO L87 Difference]: Start difference. First operand 42784 states and 44930 transitions. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 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-03 11:04:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:02,283 INFO L93 Difference]: Finished difference Result 104886 states and 110688 transitions. [2025-03-03 11:04:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:02,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 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 1219 [2025-03-03 11:04:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:02,350 INFO L225 Difference]: With dead ends: 104886 [2025-03-03 11:04:02,350 INFO L226 Difference]: Without dead ends: 61414 [2025-03-03 11:04:02,380 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-03 11:04:02,380 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 666 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:02,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 873 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:04:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61414 states. [2025-03-03 11:04:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61414 to 60034. [2025-03-03 11:04:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60034 states, 60033 states have (on average 1.0483234221178352) internal successors, (62934), 60033 states have internal predecessors, (62934), 0 states have call successors, (0), 0 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-03 11:04:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60034 states to 60034 states and 62934 transitions. [2025-03-03 11:04:02,839 INFO L78 Accepts]: Start accepts. Automaton has 60034 states and 62934 transitions. Word has length 1219 [2025-03-03 11:04:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:02,839 INFO L471 AbstractCegarLoop]: Abstraction has 60034 states and 62934 transitions. [2025-03-03 11:04:02,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 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-03 11:04:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 60034 states and 62934 transitions. [2025-03-03 11:04:02,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1234 [2025-03-03 11:04:02,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:02,850 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:04:02,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 11:04:02,850 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:02,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:02,851 INFO L85 PathProgramCache]: Analyzing trace with hash 747737214, now seen corresponding path program 1 times [2025-03-03 11:04:02,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:02,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253469446] [2025-03-03 11:04:02,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:02,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:02,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1233 statements into 1 equivalence classes. [2025-03-03 11:04:02,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1233 of 1233 statements. [2025-03-03 11:04:02,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:02,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2025-03-03 11:04:03,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253469446] [2025-03-03 11:04:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253469446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:03,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:03,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:03,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839273635] [2025-03-03 11:04:03,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:03,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:03,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:03,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:03,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:03,321 INFO L87 Difference]: Start difference. First operand 60034 states and 62934 transitions. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 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-03 11:04:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:04,776 INFO L93 Difference]: Finished difference Result 137316 states and 144564 transitions. [2025-03-03 11:04:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:04,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 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 1233 [2025-03-03 11:04:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:04,846 INFO L225 Difference]: With dead ends: 137316 [2025-03-03 11:04:04,846 INFO L226 Difference]: Without dead ends: 77284 [2025-03-03 11:04:04,877 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-03 11:04:04,878 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 642 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:04,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 279 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:04:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77284 states. [2025-03-03 11:04:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77284 to 73144. [2025-03-03 11:04:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73144 states, 73143 states have (on average 1.0447889750215331) internal successors, (76419), 73143 states have internal predecessors, (76419), 0 states have call successors, (0), 0 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-03 11:04:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73144 states to 73144 states and 76419 transitions. [2025-03-03 11:04:05,412 INFO L78 Accepts]: Start accepts. Automaton has 73144 states and 76419 transitions. Word has length 1233 [2025-03-03 11:04:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:05,413 INFO L471 AbstractCegarLoop]: Abstraction has 73144 states and 76419 transitions. [2025-03-03 11:04:05,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 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-03 11:04:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 73144 states and 76419 transitions. [2025-03-03 11:04:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1276 [2025-03-03 11:04:05,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:05,426 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:04:05,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:04:05,426 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:05,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1235993287, now seen corresponding path program 1 times [2025-03-03 11:04:05,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:05,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396666673] [2025-03-03 11:04:05,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:05,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:05,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1275 statements into 1 equivalence classes. [2025-03-03 11:04:05,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1275 of 1275 statements. [2025-03-03 11:04:05,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:05,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 560 proven. 694 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-03-03 11:04:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396666673] [2025-03-03 11:04:06,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396666673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:04:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142210332] [2025-03-03 11:04:06,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:06,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:04:06,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:04:06,822 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-03 11:04:06,822 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-03 11:04:06,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1275 statements into 1 equivalence classes. [2025-03-03 11:04:07,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1275 of 1275 statements. [2025-03-03 11:04:07,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:07,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:07,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:04:07,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:04:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2025-03-03 11:04:07,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:04:07,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142210332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:07,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:04:07,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 11:04:07,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504703278] [2025-03-03 11:04:07,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:07,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:07,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:07,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:07,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:04:07,138 INFO L87 Difference]: Start difference. First operand 73144 states and 76419 transitions. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 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-03 11:04:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:08,633 INFO L93 Difference]: Finished difference Result 164226 states and 172348 transitions. [2025-03-03 11:04:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:08,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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 1275 [2025-03-03 11:04:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:08,723 INFO L225 Difference]: With dead ends: 164226 [2025-03-03 11:04:08,723 INFO L226 Difference]: Without dead ends: 86944 [2025-03-03 11:04:08,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1280 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:04:08,774 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 624 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:08,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 881 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:04:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86944 states. [2025-03-03 11:04:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86944 to 86944. [2025-03-03 11:04:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86944 states, 86943 states have (on average 1.0443163911988314) internal successors, (90796), 86943 states have internal predecessors, (90796), 0 states have call successors, (0), 0 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-03 11:04:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86944 states to 86944 states and 90796 transitions. [2025-03-03 11:04:09,574 INFO L78 Accepts]: Start accepts. Automaton has 86944 states and 90796 transitions. Word has length 1275 [2025-03-03 11:04:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:09,575 INFO L471 AbstractCegarLoop]: Abstraction has 86944 states and 90796 transitions. [2025-03-03 11:04:09,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 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-03 11:04:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 86944 states and 90796 transitions. [2025-03-03 11:04:09,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1394 [2025-03-03 11:04:09,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:09,594 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:04:09,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 11:04:09,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 11:04:09,795 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:09,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash -669705522, now seen corresponding path program 1 times [2025-03-03 11:04:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:09,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976875333] [2025-03-03 11:04:09,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:09,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:09,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1393 statements into 1 equivalence classes. [2025-03-03 11:04:09,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1393 of 1393 statements. [2025-03-03 11:04:09,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:09,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 997 proven. 0 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2025-03-03 11:04:10,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:10,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976875333] [2025-03-03 11:04:10,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976875333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:10,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:10,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:10,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725080987] [2025-03-03 11:04:10,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:10,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:10,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:10,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:10,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:10,463 INFO L87 Difference]: Start difference. First operand 86944 states and 90796 transitions. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 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-03 11:04:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:11,773 INFO L93 Difference]: Finished difference Result 173196 states and 180899 transitions. [2025-03-03 11:04:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:11,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 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 1393 [2025-03-03 11:04:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:11,862 INFO L225 Difference]: With dead ends: 173196 [2025-03-03 11:04:11,862 INFO L226 Difference]: Without dead ends: 86254 [2025-03-03 11:04:11,912 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-03 11:04:11,912 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 500 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:11,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 935 Invalid, 1787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:04:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86254 states. [2025-03-03 11:04:12,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86254 to 84874. [2025-03-03 11:04:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84874 states, 84873 states have (on average 1.0405193642265502) internal successors, (88312), 84873 states have internal predecessors, (88312), 0 states have call successors, (0), 0 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-03 11:04:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84874 states to 84874 states and 88312 transitions. [2025-03-03 11:04:12,701 INFO L78 Accepts]: Start accepts. Automaton has 84874 states and 88312 transitions. Word has length 1393 [2025-03-03 11:04:12,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:12,702 INFO L471 AbstractCegarLoop]: Abstraction has 84874 states and 88312 transitions. [2025-03-03 11:04:12,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 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-03 11:04:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 84874 states and 88312 transitions. [2025-03-03 11:04:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1446 [2025-03-03 11:04:12,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:12,721 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:04:12,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:04:12,721 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:12,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash -906922773, now seen corresponding path program 1 times [2025-03-03 11:04:12,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:12,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111890178] [2025-03-03 11:04:12,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:12,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1445 statements into 1 equivalence classes. [2025-03-03 11:04:12,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1445 of 1445 statements. [2025-03-03 11:04:12,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:12,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1812 backedges. 795 proven. 0 refuted. 0 times theorem prover too weak. 1017 trivial. 0 not checked. [2025-03-03 11:04:14,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:14,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111890178] [2025-03-03 11:04:14,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111890178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:14,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:14,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:14,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073338930] [2025-03-03 11:04:14,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:14,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:14,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:14,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:14,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:14,412 INFO L87 Difference]: Start difference. First operand 84874 states and 88312 transitions. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 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-03 11:04:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:15,717 INFO L93 Difference]: Finished difference Result 169054 states and 175930 transitions. [2025-03-03 11:04:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:15,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 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 1445 [2025-03-03 11:04:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:15,720 INFO L225 Difference]: With dead ends: 169054 [2025-03-03 11:04:15,720 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 11:04:15,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-03 11:04:15,780 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 587 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:15,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 743 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:04:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 11:04:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 11:04:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 11:04:15,781 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1445 [2025-03-03 11:04:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:15,781 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 11:04:15,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 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-03 11:04:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 11:04:15,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 11:04:15,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 11:04:15,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 11:04:15,787 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:15,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 11:04:17,230 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:04:17,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:04:17 BoogieIcfgContainer [2025-03-03 11:04:17,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:04:17,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:04:17,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:04:17,241 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:04:17,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:23" (3/4) ... [2025-03-03 11:04:17,242 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 11:04:17,271 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-03 11:04:17,274 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 11:04:17,277 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 11:04:17,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 11:04:17,451 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 11:04:17,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 11:04:17,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:04:17,453 INFO L158 Benchmark]: Toolchain (without parser) took 58467.39ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 838.9MB). Free memory was 122.3MB in the beginning and 494.4MB in the end (delta: -372.1MB). Peak memory consumption was 467.9MB. Max. memory is 16.1GB. [2025-03-03 11:04:17,453 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:04:17,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 831.95ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 90.9MB in the end (delta: 31.0MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2025-03-03 11:04:17,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 201.45ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 101.1MB in the end (delta: -10.2MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2025-03-03 11:04:17,454 INFO L158 Benchmark]: Boogie Preprocessor took 245.84ms. Allocated memory is still 167.8MB. Free memory was 101.1MB in the beginning and 91.2MB in the end (delta: 9.9MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2025-03-03 11:04:17,454 INFO L158 Benchmark]: IcfgBuilder took 2935.13ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 91.2MB in the beginning and 204.7MB in the end (delta: -113.5MB). Peak memory consumption was 205.2MB. Max. memory is 16.1GB. [2025-03-03 11:04:17,454 INFO L158 Benchmark]: TraceAbstraction took 54035.80ms. Allocated memory was 335.5MB in the beginning and 1.0GB in the end (delta: 671.1MB). Free memory was 204.7MB in the beginning and 540.5MB in the end (delta: -335.8MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-03-03 11:04:17,457 INFO L158 Benchmark]: Witness Printer took 211.57ms. Allocated memory is still 1.0GB. Free memory was 540.5MB in the beginning and 494.4MB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-03 11:04:17,457 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 831.95ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 90.9MB in the end (delta: 31.0MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 201.45ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 101.1MB in the end (delta: -10.2MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 245.84ms. Allocated memory is still 167.8MB. Free memory was 101.1MB in the beginning and 91.2MB in the end (delta: 9.9MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2935.13ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 91.2MB in the beginning and 204.7MB in the end (delta: -113.5MB). Peak memory consumption was 205.2MB. Max. memory is 16.1GB. * TraceAbstraction took 54035.80ms. Allocated memory was 335.5MB in the beginning and 1.0GB in the end (delta: 671.1MB). Free memory was 204.7MB in the beginning and 540.5MB in the end (delta: -335.8MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 211.57ms. Allocated memory is still 1.0GB. Free memory was 540.5MB in the beginning and 494.4MB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 202]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.5s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 33.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13026 SdHoareTripleChecker+Valid, 29.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13026 mSDsluCounter, 11610 SdHoareTripleChecker+Invalid, 23.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 7474 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39275 IncrementalHoareTripleChecker+Invalid, 46749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7474 mSolverCounterUnsat, 11466 mSDtfsCounter, 39275 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2488 GetRequests, 2455 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86944occurred in iteration=17, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 9666 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 19108 NumberOfCodeBlocks, 19108 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 19087 ConstructedInterpolants, 0 QuantifiedInterpolants, 43066 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2800 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 18436/19780 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4269]: Location Invariant Derived location invariant: (((((((((a24 <= 3) && (a18 <= 9)) || (a24 == 3)) || ((a24 == 0) && (a18 == 10))) || (a24 == 1)) || ((a15 != 4) && (a24 <= 3))) || ((307 <= a3) && (a24 <= 3))) || ((a24 == 0) && (a18 == 12))) || ((a24 == 4) && (a15 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-03-03 11:04:17,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE