./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label14.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/Problem16_label14.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 37136c333282e67f438e7bf13fb35b60043f7970afe7b0fb63a25a209e0dddcf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:54:12,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:54:12,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:54:12,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:54:12,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:54:12,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:54:12,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:54:12,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:54:12,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:54:12,597 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:54:12,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:54:12,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:54:12,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:54:12,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:54:12,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:54:12,598 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:54:12,600 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:54:12,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:54:12,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:54:12,600 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 -> 37136c333282e67f438e7bf13fb35b60043f7970afe7b0fb63a25a209e0dddcf [2025-03-03 10:54:12,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:54:12,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:54:12,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:54:12,825 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:54:12,825 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:54:12,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label14.c [2025-03-03 10:54:13,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de858d1b4/6df483f8c7864445b3ade6797aaecaea/FLAG57888d060 [2025-03-03 10:54:14,339 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:54:14,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label14.c [2025-03-03 10:54:14,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de858d1b4/6df483f8c7864445b3ade6797aaecaea/FLAG57888d060 [2025-03-03 10:54:14,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de858d1b4/6df483f8c7864445b3ade6797aaecaea [2025-03-03 10:54:14,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:54:14,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:54:14,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:54:14,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:54:14,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:54:14,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:14" (1/1) ... [2025-03-03 10:54:14,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55619b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:14, skipping insertion in model container [2025-03-03 10:54:14,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:54:14" (1/1) ... [2025-03-03 10:54:14,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:54:14,677 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/Problem16_label14.c[2092,2105] [2025-03-03 10:54:14,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:54:14,888 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:54:14,899 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/Problem16_label14.c[2092,2105] [2025-03-03 10:54:14,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:54:15,005 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:54:15,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15 WrapperNode [2025-03-03 10:54:15,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:54:15,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:54:15,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:54:15,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:54:15,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,151 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-03 10:54:15,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:54:15,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:54:15,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:54:15,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:54:15,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,235 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 10:54:15,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,275 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:54:15,311 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:54:15,311 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:54:15,311 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:54:15,312 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (1/1) ... [2025-03-03 10:54:15,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:54:15,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:15,337 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 10:54:15,339 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 10:54:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:54:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:54:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:54:15,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:54:15,403 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:54:15,405 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:54:16,951 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-03 10:54:17,006 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-03 10:54:17,006 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:54:17,024 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:54:17,026 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:54:17,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:17 BoogieIcfgContainer [2025-03-03 10:54:17,027 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:54:17,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:54:17,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:54:17,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:54:17,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:54:14" (1/3) ... [2025-03-03 10:54:17,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efb7b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:17, skipping insertion in model container [2025-03-03 10:54:17,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:54:15" (2/3) ... [2025-03-03 10:54:17,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efb7b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:54:17, skipping insertion in model container [2025-03-03 10:54:17,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:54:17" (3/3) ... [2025-03-03 10:54:17,034 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label14.c [2025-03-03 10:54:17,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:54:17,046 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label14.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:54:17,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:54:17,105 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;@7b3e573c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:54:17,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:54:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 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 10:54:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 10:54:17,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:17,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:17,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:17,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash 700498764, now seen corresponding path program 1 times [2025-03-03 10:54:17,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:17,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810964885] [2025-03-03 10:54:17,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:17,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:17,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 10:54:17,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 10:54:17,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:17,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:17,319 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 10:54:17,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810964885] [2025-03-03 10:54:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810964885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:17,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:17,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:17,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390122107] [2025-03-03 10:54:17,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:17,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:17,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:17,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:17,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:17,346 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:18,548 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-03-03 10:54:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:18,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 10:54:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:18,558 INFO L225 Difference]: With dead ends: 1122 [2025-03-03 10:54:18,558 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 10:54:18,560 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 10:54:18,562 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 342 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:18,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:54:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 10:54:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-03 10:54:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 0 states have call successors, (0), 0 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 10:54:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2025-03-03 10:54:18,616 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 18 [2025-03-03 10:54:18,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:18,616 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2025-03-03 10:54:18,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2025-03-03 10:54:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 10:54:18,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:18,621 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:18,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:54:18,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:18,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash -989110608, now seen corresponding path program 1 times [2025-03-03 10:54:18,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:18,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212950332] [2025-03-03 10:54:18,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:18,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:18,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 10:54:18,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 10:54:18,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:18,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:54:18,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:18,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212950332] [2025-03-03 10:54:18,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212950332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:18,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:18,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:18,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278093806] [2025-03-03 10:54:18,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:18,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:18,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:18,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:18,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:18,820 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 10:54:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:19,992 INFO L93 Difference]: Finished difference Result 1980 states and 3133 transitions. [2025-03-03 10:54:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:19,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 10:54:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:19,996 INFO L225 Difference]: With dead ends: 1980 [2025-03-03 10:54:19,997 INFO L226 Difference]: Without dead ends: 1320 [2025-03-03 10:54:20,000 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 10:54:20,000 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 277 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:20,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 79 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:54:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-03 10:54:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-03 10:54:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.5056861258529188) internal successors, (1986), 1319 states have internal predecessors, (1986), 0 states have call successors, (0), 0 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 10:54:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1986 transitions. [2025-03-03 10:54:20,029 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1986 transitions. Word has length 89 [2025-03-03 10:54:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:20,029 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1986 transitions. [2025-03-03 10:54:20,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 10:54:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1986 transitions. [2025-03-03 10:54:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 10:54:20,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:20,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:20,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:54:20,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:20,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1638847968, now seen corresponding path program 1 times [2025-03-03 10:54:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:20,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013308627] [2025-03-03 10:54:20,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:20,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 10:54:20,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 10:54:20,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:20,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 10:54:20,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:20,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013308627] [2025-03-03 10:54:20,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013308627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:20,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:20,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:20,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846107646] [2025-03-03 10:54:20,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:20,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:20,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:20,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:20,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:20,216 INFO L87 Difference]: Start difference. First operand 1320 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 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 10:54:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:21,266 INFO L93 Difference]: Finished difference Result 3954 states and 5953 transitions. [2025-03-03 10:54:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:21,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 160 [2025-03-03 10:54:21,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:21,276 INFO L225 Difference]: With dead ends: 3954 [2025-03-03 10:54:21,277 INFO L226 Difference]: Without dead ends: 2636 [2025-03-03 10:54:21,281 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 10:54:21,283 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:21,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 205 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:54:21,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-03-03 10:54:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-03-03 10:54:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.323719165085389) internal successors, (3488), 2635 states have internal predecessors, (3488), 0 states have call successors, (0), 0 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 10:54:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3488 transitions. [2025-03-03 10:54:21,335 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3488 transitions. Word has length 160 [2025-03-03 10:54:21,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:21,336 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3488 transitions. [2025-03-03 10:54:21,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 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 10:54:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3488 transitions. [2025-03-03 10:54:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 10:54:21,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:21,338 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:21,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:54:21,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:21,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash 947314912, now seen corresponding path program 1 times [2025-03-03 10:54:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092649590] [2025-03-03 10:54:21,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:21,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 10:54:21,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 10:54:21,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:21,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:54:21,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:21,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092649590] [2025-03-03 10:54:21,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092649590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:21,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:21,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:21,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975546134] [2025-03-03 10:54:21,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:21,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:21,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:21,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:21,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:21,552 INFO L87 Difference]: Start difference. First operand 2636 states and 3488 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 10:54:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:22,571 INFO L93 Difference]: Finished difference Result 6586 states and 8891 transitions. [2025-03-03 10:54:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:22,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 184 [2025-03-03 10:54:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:22,582 INFO L225 Difference]: With dead ends: 6586 [2025-03-03 10:54:22,582 INFO L226 Difference]: Without dead ends: 3952 [2025-03-03 10:54:22,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 10:54:22,586 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:22,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 156 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:54:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-03-03 10:54:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 2965. [2025-03-03 10:54:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.3286099865047234) internal successors, (3938), 2964 states have internal predecessors, (3938), 0 states have call successors, (0), 0 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 10:54:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3938 transitions. [2025-03-03 10:54:22,636 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3938 transitions. Word has length 184 [2025-03-03 10:54:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:22,636 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 3938 transitions. [2025-03-03 10:54:22,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 10:54:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3938 transitions. [2025-03-03 10:54:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-03 10:54:22,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:22,639 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:54:22,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:54:22,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:22,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:22,640 INFO L85 PathProgramCache]: Analyzing trace with hash -446749432, now seen corresponding path program 1 times [2025-03-03 10:54:22,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:22,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782228658] [2025-03-03 10:54:22,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:22,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:22,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-03 10:54:22,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-03 10:54:22,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:22,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-03 10:54:22,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:22,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782228658] [2025-03-03 10:54:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782228658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:22,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:22,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:22,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386384911] [2025-03-03 10:54:22,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:22,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:22,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:22,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:22,852 INFO L87 Difference]: Start difference. First operand 2965 states and 3938 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 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 10:54:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:23,678 INFO L93 Difference]: Finished difference Result 7244 states and 9442 transitions. [2025-03-03 10:54:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:23,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 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 327 [2025-03-03 10:54:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:23,688 INFO L225 Difference]: With dead ends: 7244 [2025-03-03 10:54:23,688 INFO L226 Difference]: Without dead ends: 4281 [2025-03-03 10:54:23,692 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 10:54:23,693 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:23,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 83 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:54:23,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-03-03 10:54:23,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-03-03 10:54:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.2121495327102805) internal successors, (5188), 4280 states have internal predecessors, (5188), 0 states have call successors, (0), 0 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 10:54:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5188 transitions. [2025-03-03 10:54:23,741 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5188 transitions. Word has length 327 [2025-03-03 10:54:23,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:23,742 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5188 transitions. [2025-03-03 10:54:23,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 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 10:54:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5188 transitions. [2025-03-03 10:54:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-03 10:54:23,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:23,749 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:54:23,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:54:23,749 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:23,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:23,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1454000661, now seen corresponding path program 1 times [2025-03-03 10:54:23,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:23,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475387120] [2025-03-03 10:54:23,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:23,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:23,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-03 10:54:23,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-03 10:54:23,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:23,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-03 10:54:24,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475387120] [2025-03-03 10:54:24,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475387120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:24,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:24,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:54:24,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817859078] [2025-03-03 10:54:24,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:24,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:24,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:24,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:24,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:24,347 INFO L87 Difference]: Start difference. First operand 4281 states and 5188 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 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 10:54:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:25,185 INFO L93 Difference]: Finished difference Result 9218 states and 11086 transitions. [2025-03-03 10:54:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:25,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 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 441 [2025-03-03 10:54:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:25,195 INFO L225 Difference]: With dead ends: 9218 [2025-03-03 10:54:25,195 INFO L226 Difference]: Without dead ends: 4939 [2025-03-03 10:54:25,199 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 10:54:25,201 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 87 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:25,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 248 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:54:25,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-03-03 10:54:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2025-03-03 10:54:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.191170514378291) internal successors, (5882), 4938 states have internal predecessors, (5882), 0 states have call successors, (0), 0 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 10:54:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5882 transitions. [2025-03-03 10:54:25,261 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5882 transitions. Word has length 441 [2025-03-03 10:54:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:25,261 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 5882 transitions. [2025-03-03 10:54:25,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 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 10:54:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5882 transitions. [2025-03-03 10:54:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-03 10:54:25,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:25,269 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:25,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:54:25,270 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:25,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1130637615, now seen corresponding path program 1 times [2025-03-03 10:54:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234349869] [2025-03-03 10:54:25,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:25,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-03 10:54:25,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-03 10:54:25,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:25,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-03 10:54:25,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:25,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234349869] [2025-03-03 10:54:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234349869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:25,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:25,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:54:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025993060] [2025-03-03 10:54:25,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:25,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:54:25,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:25,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:54:25,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:54:25,945 INFO L87 Difference]: Start difference. First operand 4939 states and 5882 transitions. Second operand has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 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 10:54:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:27,332 INFO L93 Difference]: Finished difference Result 9077 states and 10915 transitions. [2025-03-03 10:54:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 10:54:27,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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 528 [2025-03-03 10:54:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:27,342 INFO L225 Difference]: With dead ends: 9077 [2025-03-03 10:54:27,342 INFO L226 Difference]: Without dead ends: 4610 [2025-03-03 10:54:27,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:54:27,346 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 307 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:27,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 287 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:54:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-03-03 10:54:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2025-03-03 10:54:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.0735517465827729) internal successors, (4948), 4609 states have internal predecessors, (4948), 0 states have call successors, (0), 0 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 10:54:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4948 transitions. [2025-03-03 10:54:27,399 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4948 transitions. Word has length 528 [2025-03-03 10:54:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:27,399 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 4948 transitions. [2025-03-03 10:54:27,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 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 10:54:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4948 transitions. [2025-03-03 10:54:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-03-03 10:54:27,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:27,403 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:27,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:54:27,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:27,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1165505165, now seen corresponding path program 1 times [2025-03-03 10:54:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:27,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493855632] [2025-03-03 10:54:27,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:27,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-03-03 10:54:27,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-03-03 10:54:27,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:27,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-03 10:54:27,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:27,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493855632] [2025-03-03 10:54:27,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493855632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:27,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:27,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:27,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587205564] [2025-03-03 10:54:27,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:27,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:27,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:27,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:27,739 INFO L87 Difference]: Start difference. First operand 4610 states and 4948 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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 10:54:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:28,464 INFO L93 Difference]: Finished difference Result 10863 states and 11778 transitions. [2025-03-03 10:54:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:28,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 556 [2025-03-03 10:54:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:28,478 INFO L225 Difference]: With dead ends: 10863 [2025-03-03 10:54:28,478 INFO L226 Difference]: Without dead ends: 6913 [2025-03-03 10:54:28,481 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 10:54:28,482 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:28,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 434 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:54:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-03-03 10:54:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6584. [2025-03-03 10:54:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.058332067446453) internal successors, (6967), 6583 states have internal predecessors, (6967), 0 states have call successors, (0), 0 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 10:54:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6967 transitions. [2025-03-03 10:54:28,542 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6967 transitions. Word has length 556 [2025-03-03 10:54:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:28,543 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6967 transitions. [2025-03-03 10:54:28,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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 10:54:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6967 transitions. [2025-03-03 10:54:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-03 10:54:28,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:28,550 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:54:28,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:54:28,550 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:28,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:28,551 INFO L85 PathProgramCache]: Analyzing trace with hash -367934326, now seen corresponding path program 1 times [2025-03-03 10:54:28,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:28,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344264818] [2025-03-03 10:54:28,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:28,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:28,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-03 10:54:28,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-03 10:54:28,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:28,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-03 10:54:28,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:28,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344264818] [2025-03-03 10:54:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344264818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:28,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:28,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:28,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565045607] [2025-03-03 10:54:28,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:28,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:28,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:28,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:28,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:28,868 INFO L87 Difference]: Start difference. First operand 6584 states and 6967 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 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 10:54:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:29,536 INFO L93 Difference]: Finished difference Result 14482 states and 15462 transitions. [2025-03-03 10:54:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:29,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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 660 [2025-03-03 10:54:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:29,548 INFO L225 Difference]: With dead ends: 14482 [2025-03-03 10:54:29,548 INFO L226 Difference]: Without dead ends: 8558 [2025-03-03 10:54:29,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:29,553 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 188 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:29,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 54 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:54:29,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2025-03-03 10:54:29,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8229. [2025-03-03 10:54:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0630772970345164) internal successors, (8747), 8228 states have internal predecessors, (8747), 0 states have call successors, (0), 0 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 10:54:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8747 transitions. [2025-03-03 10:54:29,624 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8747 transitions. Word has length 660 [2025-03-03 10:54:29,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:29,625 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8747 transitions. [2025-03-03 10:54:29,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 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 10:54:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8747 transitions. [2025-03-03 10:54:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2025-03-03 10:54:29,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:29,635 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:54:29,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:54:29,636 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:29,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:29,639 INFO L85 PathProgramCache]: Analyzing trace with hash 723788986, now seen corresponding path program 1 times [2025-03-03 10:54:29,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:29,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383902230] [2025-03-03 10:54:29,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:29,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:29,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 891 statements into 1 equivalence classes. [2025-03-03 10:54:29,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 891 of 891 statements. [2025-03-03 10:54:29,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:29,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2025-03-03 10:54:30,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:30,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383902230] [2025-03-03 10:54:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383902230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:30,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11083142] [2025-03-03 10:54:30,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:30,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:30,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:30,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:30,081 INFO L87 Difference]: Start difference. First operand 8229 states and 8747 transitions. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 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 10:54:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:30,823 INFO L93 Difference]: Finished difference Result 20075 states and 21474 transitions. [2025-03-03 10:54:30,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:30,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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 891 [2025-03-03 10:54:30,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:30,839 INFO L225 Difference]: With dead ends: 20075 [2025-03-03 10:54:30,839 INFO L226 Difference]: Without dead ends: 11190 [2025-03-03 10:54:30,845 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 10:54:30,846 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 145 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:30,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 428 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:54:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2025-03-03 10:54:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 11190. [2025-03-03 10:54:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11190 states, 11189 states have (on average 1.051300384306015) internal successors, (11763), 11189 states have internal predecessors, (11763), 0 states have call successors, (0), 0 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 10:54:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 11763 transitions. [2025-03-03 10:54:30,931 INFO L78 Accepts]: Start accepts. Automaton has 11190 states and 11763 transitions. Word has length 891 [2025-03-03 10:54:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:30,932 INFO L471 AbstractCegarLoop]: Abstraction has 11190 states and 11763 transitions. [2025-03-03 10:54:30,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 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 10:54:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 11190 states and 11763 transitions. [2025-03-03 10:54:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2025-03-03 10:54:30,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:30,942 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:30,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:54:30,942 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:30,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1749625021, now seen corresponding path program 1 times [2025-03-03 10:54:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:30,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89285927] [2025-03-03 10:54:30,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:30,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:30,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 928 statements into 1 equivalence classes. [2025-03-03 10:54:31,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 928 of 928 statements. [2025-03-03 10:54:31,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:31,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1399 backedges. 1012 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-03-03 10:54:31,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:31,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89285927] [2025-03-03 10:54:31,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89285927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:31,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:31,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:31,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850899943] [2025-03-03 10:54:31,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:31,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:31,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:31,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:31,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:31,463 INFO L87 Difference]: Start difference. First operand 11190 states and 11763 transitions. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 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 10:54:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:32,051 INFO L93 Difference]: Finished difference Result 25010 states and 26420 transitions. [2025-03-03 10:54:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:32,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 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 928 [2025-03-03 10:54:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:32,069 INFO L225 Difference]: With dead ends: 25010 [2025-03-03 10:54:32,069 INFO L226 Difference]: Without dead ends: 14480 [2025-03-03 10:54:32,078 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 10:54:32,078 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:32,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 434 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-03 10:54:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 13822. [2025-03-03 10:54:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0452933941104117) internal successors, (14447), 13821 states have internal predecessors, (14447), 0 states have call successors, (0), 0 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 10:54:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14447 transitions. [2025-03-03 10:54:32,187 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14447 transitions. Word has length 928 [2025-03-03 10:54:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:32,187 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14447 transitions. [2025-03-03 10:54:32,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 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 10:54:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14447 transitions. [2025-03-03 10:54:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 930 [2025-03-03 10:54:32,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:32,197 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:32,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:54:32,197 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:32,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:32,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1542104689, now seen corresponding path program 1 times [2025-03-03 10:54:32,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:32,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709063040] [2025-03-03 10:54:32,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:32,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:32,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 929 statements into 1 equivalence classes. [2025-03-03 10:54:32,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 929 of 929 statements. [2025-03-03 10:54:32,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:32,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2025-03-03 10:54:32,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:32,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709063040] [2025-03-03 10:54:32,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709063040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:32,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:32,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:32,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958443847] [2025-03-03 10:54:32,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:32,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:32,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:32,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:32,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:32,574 INFO L87 Difference]: Start difference. First operand 13822 states and 14447 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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 10:54:33,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:33,231 INFO L93 Difference]: Finished difference Result 27313 states and 28555 transitions. [2025-03-03 10:54:33,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 929 [2025-03-03 10:54:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:33,250 INFO L225 Difference]: With dead ends: 27313 [2025-03-03 10:54:33,250 INFO L226 Difference]: Without dead ends: 13822 [2025-03-03 10:54:33,260 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 10:54:33,262 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 317 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:33,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 426 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:54:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-03-03 10:54:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13164. [2025-03-03 10:54:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0314517967028793) internal successors, (13577), 13163 states have internal predecessors, (13577), 0 states have call successors, (0), 0 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 10:54:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13577 transitions. [2025-03-03 10:54:33,371 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13577 transitions. Word has length 929 [2025-03-03 10:54:33,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:33,372 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13577 transitions. [2025-03-03 10:54:33,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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 10:54:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13577 transitions. [2025-03-03 10:54:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1003 [2025-03-03 10:54:33,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:33,383 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:33,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:54:33,383 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:33,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash 4069779, now seen corresponding path program 1 times [2025-03-03 10:54:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2935010] [2025-03-03 10:54:33,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:33,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1002 statements into 1 equivalence classes. [2025-03-03 10:54:33,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1002 of 1002 statements. [2025-03-03 10:54:33,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:33,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 470 proven. 674 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-03 10:54:34,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:34,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2935010] [2025-03-03 10:54:34,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2935010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:34,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084824259] [2025-03-03 10:54:34,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:34,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:34,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:34,384 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 10:54:34,387 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 10:54:34,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1002 statements into 1 equivalence classes. [2025-03-03 10:54:34,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1002 of 1002 statements. [2025-03-03 10:54:34,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:34,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:34,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:54:34,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 727 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-03 10:54:35,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:54:35,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084824259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:35,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:54:35,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:54:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861360544] [2025-03-03 10:54:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:35,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:35,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:35,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:35,028 INFO L87 Difference]: Start difference. First operand 13164 states and 13577 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 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 10:54:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:35,603 INFO L93 Difference]: Finished difference Result 25668 states and 26485 transitions. [2025-03-03 10:54:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:35,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 1002 [2025-03-03 10:54:35,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:35,616 INFO L225 Difference]: With dead ends: 25668 [2025-03-03 10:54:35,616 INFO L226 Difference]: Without dead ends: 13164 [2025-03-03 10:54:35,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1006 GetRequests, 1002 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:35,624 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 45 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:35,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 377 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-03-03 10:54:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2025-03-03 10:54:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0280331231482185) internal successors, (13532), 13163 states have internal predecessors, (13532), 0 states have call successors, (0), 0 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 10:54:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13532 transitions. [2025-03-03 10:54:35,721 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13532 transitions. Word has length 1002 [2025-03-03 10:54:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:35,722 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13532 transitions. [2025-03-03 10:54:35,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 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 10:54:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13532 transitions. [2025-03-03 10:54:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1161 [2025-03-03 10:54:35,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:35,736 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:35,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:54:35,936 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 10:54:35,937 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:35,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:35,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1506343915, now seen corresponding path program 1 times [2025-03-03 10:54:35,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:35,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363632627] [2025-03-03 10:54:35,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:35,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:35,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1160 statements into 1 equivalence classes. [2025-03-03 10:54:36,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1160 of 1160 statements. [2025-03-03 10:54:36,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:36,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2152 backedges. 1513 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2025-03-03 10:54:37,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:37,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363632627] [2025-03-03 10:54:37,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363632627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:37,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:37,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:54:37,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313307476] [2025-03-03 10:54:37,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:37,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:54:37,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:37,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:54:37,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:37,029 INFO L87 Difference]: Start difference. First operand 13164 states and 13532 transitions. Second operand has 4 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 0 states have call successors, (0), 0 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 10:54:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:38,009 INFO L93 Difference]: Finished difference Result 25678 states and 26405 transitions. [2025-03-03 10:54:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:54:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 0 states have call successors, (0), 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 1160 [2025-03-03 10:54:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:38,022 INFO L225 Difference]: With dead ends: 25678 [2025-03-03 10:54:38,022 INFO L226 Difference]: Without dead ends: 13174 [2025-03-03 10:54:38,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:54:38,027 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:38,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 445 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:54:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13174 states. [2025-03-03 10:54:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13174 to 12835. [2025-03-03 10:54:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0280504908835906) internal successors, (13194), 12834 states have internal predecessors, (13194), 0 states have call successors, (0), 0 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 10:54:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13194 transitions. [2025-03-03 10:54:38,123 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13194 transitions. Word has length 1160 [2025-03-03 10:54:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:38,124 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13194 transitions. [2025-03-03 10:54:38,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 0 states have call successors, (0), 0 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 10:54:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13194 transitions. [2025-03-03 10:54:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1176 [2025-03-03 10:54:38,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:38,137 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:54:38,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:54:38,137 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:38,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash 85345654, now seen corresponding path program 1 times [2025-03-03 10:54:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948782164] [2025-03-03 10:54:38,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:38,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1175 statements into 1 equivalence classes. [2025-03-03 10:54:38,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1175 of 1175 statements. [2025-03-03 10:54:38,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:38,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 1471 proven. 0 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2025-03-03 10:54:38,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:38,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948782164] [2025-03-03 10:54:38,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948782164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:38,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:38,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:38,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845751912] [2025-03-03 10:54:38,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:38,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:38,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:38,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:38,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:38,913 INFO L87 Difference]: Start difference. First operand 12835 states and 13194 transitions. Second operand has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 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 10:54:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:39,515 INFO L93 Difference]: Finished difference Result 25668 states and 26388 transitions. [2025-03-03 10:54:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:39,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 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 1175 [2025-03-03 10:54:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:39,528 INFO L225 Difference]: With dead ends: 25668 [2025-03-03 10:54:39,528 INFO L226 Difference]: Without dead ends: 13493 [2025-03-03 10:54:39,536 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 10:54:39,536 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:39,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-03 10:54:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2025-03-03 10:54:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.027053068485028) internal successors, (13857), 13492 states have internal predecessors, (13857), 0 states have call successors, (0), 0 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 10:54:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13857 transitions. [2025-03-03 10:54:39,662 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13857 transitions. Word has length 1175 [2025-03-03 10:54:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:39,663 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13857 transitions. [2025-03-03 10:54:39,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 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 10:54:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13857 transitions. [2025-03-03 10:54:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1201 [2025-03-03 10:54:39,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:39,677 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:39,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:54:39,677 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:39,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash -901450909, now seen corresponding path program 1 times [2025-03-03 10:54:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:39,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041419457] [2025-03-03 10:54:39,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:39,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1200 statements into 1 equivalence classes. [2025-03-03 10:54:39,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1200 of 1200 statements. [2025-03-03 10:54:39,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:39,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 1609 proven. 0 refuted. 0 times theorem prover too weak. 809 trivial. 0 not checked. [2025-03-03 10:54:40,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:40,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041419457] [2025-03-03 10:54:40,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041419457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:40,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:40,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:54:40,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994046772] [2025-03-03 10:54:40,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:40,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:54:40,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:40,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:54:40,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:40,635 INFO L87 Difference]: Start difference. First operand 13493 states and 13857 transitions. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 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 10:54:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:41,396 INFO L93 Difference]: Finished difference Result 26326 states and 27045 transitions. [2025-03-03 10:54:41,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:54:41,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 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 1200 [2025-03-03 10:54:41,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:41,410 INFO L225 Difference]: With dead ends: 26326 [2025-03-03 10:54:41,411 INFO L226 Difference]: Without dead ends: 13493 [2025-03-03 10:54:41,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:54:41,421 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 120 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:41,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 564 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:54:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-03 10:54:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2025-03-03 10:54:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0263118885265343) internal successors, (13847), 13492 states have internal predecessors, (13847), 0 states have call successors, (0), 0 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 10:54:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13847 transitions. [2025-03-03 10:54:41,531 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13847 transitions. Word has length 1200 [2025-03-03 10:54:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:41,532 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13847 transitions. [2025-03-03 10:54:41,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 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 10:54:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13847 transitions. [2025-03-03 10:54:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2025-03-03 10:54:41,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:41,544 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:41,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:54:41,544 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:41,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2145336883, now seen corresponding path program 1 times [2025-03-03 10:54:41,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:41,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62972594] [2025-03-03 10:54:41,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:41,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1229 statements into 1 equivalence classes. [2025-03-03 10:54:41,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1229 of 1229 statements. [2025-03-03 10:54:41,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:41,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2788 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-03-03 10:54:42,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:42,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62972594] [2025-03-03 10:54:42,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62972594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:42,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093554512] [2025-03-03 10:54:42,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:42,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:42,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:42,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:42,037 INFO L87 Difference]: Start difference. First operand 13493 states and 13847 transitions. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 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 10:54:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:42,606 INFO L93 Difference]: Finished difference Result 29287 states and 30124 transitions. [2025-03-03 10:54:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:42,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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 1229 [2025-03-03 10:54:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:42,619 INFO L225 Difference]: With dead ends: 29287 [2025-03-03 10:54:42,620 INFO L226 Difference]: Without dead ends: 14480 [2025-03-03 10:54:42,629 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 10:54:42,630 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 147 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:42,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 413 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-03 10:54:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2025-03-03 10:54:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.024725464465778) internal successors, (14837), 14479 states have internal predecessors, (14837), 0 states have call successors, (0), 0 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 10:54:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 14837 transitions. [2025-03-03 10:54:42,746 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 14837 transitions. Word has length 1229 [2025-03-03 10:54:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:42,747 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 14837 transitions. [2025-03-03 10:54:42,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 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 10:54:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 14837 transitions. [2025-03-03 10:54:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1323 [2025-03-03 10:54:42,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:42,762 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:54:42,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:54:42,763 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:42,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 784716999, now seen corresponding path program 1 times [2025-03-03 10:54:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063654984] [2025-03-03 10:54:42,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:42,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:42,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-03-03 10:54:42,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-03-03 10:54:42,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:42,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2940 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 2829 trivial. 0 not checked. [2025-03-03 10:54:43,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:43,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063654984] [2025-03-03 10:54:43,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063654984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:43,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:43,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662722618] [2025-03-03 10:54:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:43,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:43,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:43,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:43,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:43,302 INFO L87 Difference]: Start difference. First operand 14480 states and 14837 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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 10:54:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:43,866 INFO L93 Difference]: Finished difference Result 29616 states and 30347 transitions. [2025-03-03 10:54:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 1322 [2025-03-03 10:54:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:43,880 INFO L225 Difference]: With dead ends: 29616 [2025-03-03 10:54:43,880 INFO L226 Difference]: Without dead ends: 14151 [2025-03-03 10:54:43,891 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 10:54:43,891 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 318 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:43,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 416 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-03 10:54:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 12506. [2025-03-03 10:54:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0195921631347462) internal successors, (12750), 12505 states have internal predecessors, (12750), 0 states have call successors, (0), 0 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 10:54:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12750 transitions. [2025-03-03 10:54:43,991 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12750 transitions. Word has length 1322 [2025-03-03 10:54:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:43,992 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12750 transitions. [2025-03-03 10:54:43,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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 10:54:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12750 transitions. [2025-03-03 10:54:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1441 [2025-03-03 10:54:44,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:44,006 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:44,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:54:44,007 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:44,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1730859405, now seen corresponding path program 1 times [2025-03-03 10:54:44,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:44,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870270139] [2025-03-03 10:54:44,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:44,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1440 statements into 1 equivalence classes. [2025-03-03 10:54:44,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1440 of 1440 statements. [2025-03-03 10:54:44,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:44,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3913 backedges. 1185 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-03 10:54:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870270139] [2025-03-03 10:54:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870270139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:44,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001538179] [2025-03-03 10:54:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:44,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:44,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:44,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:44,605 INFO L87 Difference]: Start difference. First operand 12506 states and 12750 transitions. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 10:54:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:45,135 INFO L93 Difference]: Finished difference Result 24681 states and 25167 transitions. [2025-03-03 10:54:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:45,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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 1440 [2025-03-03 10:54:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:45,146 INFO L225 Difference]: With dead ends: 24681 [2025-03-03 10:54:45,146 INFO L226 Difference]: Without dead ends: 12506 [2025-03-03 10:54:45,153 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 10:54:45,153 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 139 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:45,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 402 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-03-03 10:54:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12177. [2025-03-03 10:54:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0155223390275954) internal successors, (12365), 12176 states have internal predecessors, (12365), 0 states have call successors, (0), 0 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 10:54:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12365 transitions. [2025-03-03 10:54:45,228 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12365 transitions. Word has length 1440 [2025-03-03 10:54:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:45,229 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12365 transitions. [2025-03-03 10:54:45,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 10:54:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12365 transitions. [2025-03-03 10:54:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1769 [2025-03-03 10:54:45,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:45,278 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:54:45,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:54:45,279 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:45,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash -930793837, now seen corresponding path program 1 times [2025-03-03 10:54:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:45,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326097697] [2025-03-03 10:54:45,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:45,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1768 statements into 1 equivalence classes. [2025-03-03 10:54:45,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1768 of 1768 statements. [2025-03-03 10:54:45,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:45,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5350 backedges. 2964 proven. 66 refuted. 0 times theorem prover too weak. 2320 trivial. 0 not checked. [2025-03-03 10:54:46,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:46,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326097697] [2025-03-03 10:54:46,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326097697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:46,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208889477] [2025-03-03 10:54:46,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:46,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:46,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:46,791 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 10:54:46,792 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 10:54:46,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1768 statements into 1 equivalence classes. [2025-03-03 10:54:47,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1768 of 1768 statements. [2025-03-03 10:54:47,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:47,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:47,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 2028 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:54:47,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5350 backedges. 2376 proven. 201 refuted. 0 times theorem prover too weak. 2773 trivial. 0 not checked. [2025-03-03 10:54:49,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:54:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5350 backedges. 2376 proven. 201 refuted. 0 times theorem prover too weak. 2773 trivial. 0 not checked. [2025-03-03 10:54:52,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208889477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:54:52,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:54:52,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-03 10:54:52,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343193058] [2025-03-03 10:54:52,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:54:52,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:54:52,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:52,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:54:52,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:54:52,209 INFO L87 Difference]: Start difference. First operand 12177 states and 12365 transitions. Second operand has 9 states, 9 states have (on average 198.77777777777777) internal successors, (1789), 8 states have internal predecessors, (1789), 0 states have call successors, (0), 0 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 10:54:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:55,798 INFO L93 Difference]: Finished difference Result 34551 states and 35107 transitions. [2025-03-03 10:54:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:54:55,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 198.77777777777777) internal successors, (1789), 8 states have internal predecessors, (1789), 0 states have call successors, (0), 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 1768 [2025-03-03 10:54:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:55,817 INFO L225 Difference]: With dead ends: 34551 [2025-03-03 10:54:55,817 INFO L226 Difference]: Without dead ends: 22705 [2025-03-03 10:54:55,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3546 GetRequests, 3531 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-03 10:54:55,823 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1930 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5807 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 6124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 5807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:55,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 74 Invalid, 6124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 5807 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 10:54:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22705 states. [2025-03-03 10:54:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22705 to 16783. [2025-03-03 10:54:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0151948516267428) internal successors, (17037), 16782 states have internal predecessors, (17037), 0 states have call successors, (0), 0 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 10:54:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17037 transitions. [2025-03-03 10:54:55,970 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17037 transitions. Word has length 1768 [2025-03-03 10:54:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:55,970 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17037 transitions. [2025-03-03 10:54:55,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 198.77777777777777) internal successors, (1789), 8 states have internal predecessors, (1789), 0 states have call successors, (0), 0 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 10:54:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17037 transitions. [2025-03-03 10:54:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1799 [2025-03-03 10:54:56,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:56,057 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:56,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:54:56,258 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,SelfDestructingSolverStorable19 [2025-03-03 10:54:56,258 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:56,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:56,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2100629408, now seen corresponding path program 1 times [2025-03-03 10:54:56,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:56,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824522190] [2025-03-03 10:54:56,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:56,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1798 statements into 1 equivalence classes. [2025-03-03 10:54:56,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1798 of 1798 statements. [2025-03-03 10:54:56,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:56,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6034 backedges. 2503 proven. 0 refuted. 0 times theorem prover too weak. 3531 trivial. 0 not checked. [2025-03-03 10:54:57,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:57,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824522190] [2025-03-03 10:54:57,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824522190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:57,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:57,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:57,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182045493] [2025-03-03 10:54:57,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:57,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:54:57,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:57,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:54:57,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:57,810 INFO L87 Difference]: Start difference. First operand 16783 states and 17037 transitions. Second operand has 4 states, 4 states have (on average 182.75) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 0 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 10:54:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:58,513 INFO L93 Difference]: Finished difference Result 33564 states and 34075 transitions. [2025-03-03 10:54:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:58,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 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 1798 [2025-03-03 10:54:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:58,526 INFO L225 Difference]: With dead ends: 33564 [2025-03-03 10:54:58,526 INFO L226 Difference]: Without dead ends: 17112 [2025-03-03 10:54:58,530 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 10:54:58,532 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 173 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:58,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 96 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:54:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-03-03 10:54:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 17112. [2025-03-03 10:54:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17111 states have (on average 1.0150195780492082) internal successors, (17368), 17111 states have internal predecessors, (17368), 0 states have call successors, (0), 0 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 10:54:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 17368 transitions. [2025-03-03 10:54:58,703 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 17368 transitions. Word has length 1798 [2025-03-03 10:54:58,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:58,703 INFO L471 AbstractCegarLoop]: Abstraction has 17112 states and 17368 transitions. [2025-03-03 10:54:58,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 0 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 10:54:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 17368 transitions. [2025-03-03 10:54:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1862 [2025-03-03 10:54:58,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:58,734 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:58,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:54:58,735 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:58,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:58,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1745989966, now seen corresponding path program 1 times [2025-03-03 10:54:58,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:58,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903916076] [2025-03-03 10:54:58,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:58,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:58,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1861 statements into 1 equivalence classes. [2025-03-03 10:54:58,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1861 of 1861 statements. [2025-03-03 10:54:58,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:58,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6312 backedges. 3360 proven. 0 refuted. 0 times theorem prover too weak. 2952 trivial. 0 not checked. [2025-03-03 10:55:00,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:00,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903916076] [2025-03-03 10:55:00,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903916076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:00,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:00,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:00,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532202978] [2025-03-03 10:55:00,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:00,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:00,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:00,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:00,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:00,438 INFO L87 Difference]: Start difference. First operand 17112 states and 17368 transitions. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 10:55:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:01,066 INFO L93 Difference]: Finished difference Result 35867 states and 36411 transitions. [2025-03-03 10:55:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:01,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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 1861 [2025-03-03 10:55:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:01,083 INFO L225 Difference]: With dead ends: 35867 [2025-03-03 10:55:01,083 INFO L226 Difference]: Without dead ends: 19415 [2025-03-03 10:55:01,089 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 10:55:01,100 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 207 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:01,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 43 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2025-03-03 10:55:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 17770. [2025-03-03 10:55:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17770 states, 17769 states have (on average 1.0147447802352412) internal successors, (18031), 17769 states have internal predecessors, (18031), 0 states have call successors, (0), 0 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 10:55:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17770 states to 17770 states and 18031 transitions. [2025-03-03 10:55:01,298 INFO L78 Accepts]: Start accepts. Automaton has 17770 states and 18031 transitions. Word has length 1861 [2025-03-03 10:55:01,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:01,298 INFO L471 AbstractCegarLoop]: Abstraction has 17770 states and 18031 transitions. [2025-03-03 10:55:01,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 10:55:01,299 INFO L276 IsEmpty]: Start isEmpty. Operand 17770 states and 18031 transitions. [2025-03-03 10:55:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1903 [2025-03-03 10:55:01,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:01,320 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:01,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:55:01,321 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:01,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:01,322 INFO L85 PathProgramCache]: Analyzing trace with hash -940464114, now seen corresponding path program 1 times [2025-03-03 10:55:01,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:01,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684911500] [2025-03-03 10:55:01,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:01,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:01,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1902 statements into 1 equivalence classes. [2025-03-03 10:55:01,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1902 of 1902 statements. [2025-03-03 10:55:01,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:01,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 5172 proven. 41 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked. [2025-03-03 10:55:03,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684911500] [2025-03-03 10:55:03,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684911500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769917906] [2025-03-03 10:55:03,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:03,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:03,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:03,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:55:03,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:55:04,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1902 statements into 1 equivalence classes. [2025-03-03 10:55:04,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1902 of 1902 statements. [2025-03-03 10:55:04,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:04,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:04,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 2206 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:55:04,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:55:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 3830 proven. 0 refuted. 0 times theorem prover too weak. 3165 trivial. 0 not checked. [2025-03-03 10:55:04,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:55:04,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769917906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:04,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:55:04,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:55:04,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299069204] [2025-03-03 10:55:04,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:04,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:04,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:04,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:04,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:55:04,719 INFO L87 Difference]: Start difference. First operand 17770 states and 18031 transitions. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 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 10:55:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:05,274 INFO L93 Difference]: Finished difference Result 34880 states and 35398 transitions. [2025-03-03 10:55:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:05,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 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 1902 [2025-03-03 10:55:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:05,288 INFO L225 Difference]: With dead ends: 34880 [2025-03-03 10:55:05,288 INFO L226 Difference]: Without dead ends: 17770 [2025-03-03 10:55:05,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1906 GetRequests, 1902 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:55:05,297 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:05,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 418 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2025-03-03 10:55:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17770. [2025-03-03 10:55:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17770 states, 17769 states have (on average 1.014575946873769) internal successors, (18028), 17769 states have internal predecessors, (18028), 0 states have call successors, (0), 0 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 10:55:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17770 states to 17770 states and 18028 transitions. [2025-03-03 10:55:05,418 INFO L78 Accepts]: Start accepts. Automaton has 17770 states and 18028 transitions. Word has length 1902 [2025-03-03 10:55:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:05,419 INFO L471 AbstractCegarLoop]: Abstraction has 17770 states and 18028 transitions. [2025-03-03 10:55:05,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 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 10:55:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 17770 states and 18028 transitions. [2025-03-03 10:55:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2159 [2025-03-03 10:55:05,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:05,480 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:55:05,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:55:05,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:05,681 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:05,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash -634680881, now seen corresponding path program 1 times [2025-03-03 10:55:05,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:05,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783254332] [2025-03-03 10:55:05,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:05,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:05,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2158 statements into 1 equivalence classes. [2025-03-03 10:55:05,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2158 of 2158 statements. [2025-03-03 10:55:05,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:05,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9761 backedges. 1920 proven. 0 refuted. 0 times theorem prover too weak. 7841 trivial. 0 not checked. [2025-03-03 10:55:06,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:06,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783254332] [2025-03-03 10:55:06,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783254332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:06,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:06,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:06,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411931287] [2025-03-03 10:55:06,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:06,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:06,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:06,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:06,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:06,546 INFO L87 Difference]: Start difference. First operand 17770 states and 18028 transitions. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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 10:55:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:07,257 INFO L93 Difference]: Finished difference Result 36854 states and 37400 transitions. [2025-03-03 10:55:07,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:07,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 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 2158 [2025-03-03 10:55:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:07,279 INFO L225 Difference]: With dead ends: 36854 [2025-03-03 10:55:07,279 INFO L226 Difference]: Without dead ends: 19744 [2025-03-03 10:55:07,291 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 10:55:07,292 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 138 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:07,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 416 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19744 states. [2025-03-03 10:55:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19744 to 19415. [2025-03-03 10:55:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.0142680539816626) internal successors, (19691), 19414 states have internal predecessors, (19691), 0 states have call successors, (0), 0 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 10:55:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19691 transitions. [2025-03-03 10:55:07,512 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19691 transitions. Word has length 2158 [2025-03-03 10:55:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:07,514 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19691 transitions. [2025-03-03 10:55:07,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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 10:55:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19691 transitions. [2025-03-03 10:55:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2206 [2025-03-03 10:55:07,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:07,584 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:55:07,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:55:07,585 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:07,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash 992966367, now seen corresponding path program 1 times [2025-03-03 10:55:07,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:07,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758727630] [2025-03-03 10:55:07,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:07,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:07,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2205 statements into 1 equivalence classes. [2025-03-03 10:55:07,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2205 of 2205 statements. [2025-03-03 10:55:07,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:07,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 6977 proven. 153 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2025-03-03 10:55:09,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758727630] [2025-03-03 10:55:09,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758727630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697038235] [2025-03-03 10:55:09,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:09,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:09,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:09,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:55:09,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:55:10,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2205 statements into 1 equivalence classes. [2025-03-03 10:55:10,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2205 of 2205 statements. [2025-03-03 10:55:10,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:10,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:10,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:55:10,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:55:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 5604 proven. 0 refuted. 0 times theorem prover too weak. 4396 trivial. 0 not checked. [2025-03-03 10:55:10,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:55:10,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697038235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:10,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:55:10,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:55:10,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851696695] [2025-03-03 10:55:10,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:10,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:10,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:10,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:10,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:55:10,574 INFO L87 Difference]: Start difference. First operand 19415 states and 19691 transitions. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 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 10:55:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:11,154 INFO L93 Difference]: Finished difference Result 40144 states and 40721 transitions. [2025-03-03 10:55:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:11,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 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 2205 [2025-03-03 10:55:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:11,174 INFO L225 Difference]: With dead ends: 40144 [2025-03-03 10:55:11,174 INFO L226 Difference]: Without dead ends: 21389 [2025-03-03 10:55:11,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2210 GetRequests, 2205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:55:11,187 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 223 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:11,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 416 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:11,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21389 states. [2025-03-03 10:55:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21389 to 20402. [2025-03-03 10:55:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20402 states, 20401 states have (on average 1.0138718690260282) internal successors, (20684), 20401 states have internal predecessors, (20684), 0 states have call successors, (0), 0 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 10:55:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20402 states to 20402 states and 20684 transitions. [2025-03-03 10:55:11,403 INFO L78 Accepts]: Start accepts. Automaton has 20402 states and 20684 transitions. Word has length 2205 [2025-03-03 10:55:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:11,403 INFO L471 AbstractCegarLoop]: Abstraction has 20402 states and 20684 transitions. [2025-03-03 10:55:11,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 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 10:55:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 20402 states and 20684 transitions. [2025-03-03 10:55:11,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2330 [2025-03-03 10:55:11,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:11,448 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:55:11,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:55:11,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:11,649 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:11,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:11,650 INFO L85 PathProgramCache]: Analyzing trace with hash 317513346, now seen corresponding path program 1 times [2025-03-03 10:55:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:11,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951823765] [2025-03-03 10:55:11,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:11,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:11,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2329 statements into 1 equivalence classes. [2025-03-03 10:55:11,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2329 of 2329 statements. [2025-03-03 10:55:11,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:11,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10622 backedges. 7517 proven. 153 refuted. 0 times theorem prover too weak. 2952 trivial. 0 not checked. [2025-03-03 10:55:14,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:14,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951823765] [2025-03-03 10:55:14,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951823765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:14,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904660980] [2025-03-03 10:55:14,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:14,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:14,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:14,324 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:55:14,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:55:14,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2329 statements into 1 equivalence classes. [2025-03-03 10:55:14,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2329 of 2329 statements. [2025-03-03 10:55:14,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:14,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:14,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 2647 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:55:14,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:55:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10622 backedges. 3729 proven. 0 refuted. 0 times theorem prover too weak. 6893 trivial. 0 not checked. [2025-03-03 10:55:15,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:55:15,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904660980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:15,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:55:15,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:55:15,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532014579] [2025-03-03 10:55:15,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:15,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:15,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:15,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:15,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:55:15,213 INFO L87 Difference]: Start difference. First operand 20402 states and 20684 transitions. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 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 10:55:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:15,956 INFO L93 Difference]: Finished difference Result 40802 states and 41367 transitions. [2025-03-03 10:55:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:15,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 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 2329 [2025-03-03 10:55:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:15,991 INFO L225 Difference]: With dead ends: 40802 [2025-03-03 10:55:15,992 INFO L226 Difference]: Without dead ends: 21060 [2025-03-03 10:55:16,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2334 GetRequests, 2329 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:55:16,006 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:16,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 24 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:55:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-03-03 10:55:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 20073. [2025-03-03 10:55:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.01360103626943) internal successors, (20345), 20072 states have internal predecessors, (20345), 0 states have call successors, (0), 0 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 10:55:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20345 transitions. [2025-03-03 10:55:16,164 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20345 transitions. Word has length 2329 [2025-03-03 10:55:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:16,165 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20345 transitions. [2025-03-03 10:55:16,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 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 10:55:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20345 transitions. [2025-03-03 10:55:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2396 [2025-03-03 10:55:16,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:16,195 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:55:16,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:55:16,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 10:55:16,396 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:16,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1345281863, now seen corresponding path program 1 times [2025-03-03 10:55:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:16,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964229451] [2025-03-03 10:55:16,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:16,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:16,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2395 statements into 1 equivalence classes. [2025-03-03 10:55:16,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2395 of 2395 statements. [2025-03-03 10:55:16,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:16,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11055 backedges. 7811 proven. 153 refuted. 0 times theorem prover too weak. 3091 trivial. 0 not checked. [2025-03-03 10:55:19,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:19,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964229451] [2025-03-03 10:55:19,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964229451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:19,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005311822] [2025-03-03 10:55:19,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:19,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:19,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:19,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:55:19,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:55:19,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2395 statements into 1 equivalence classes. [2025-03-03 10:55:19,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2395 of 2395 statements. [2025-03-03 10:55:19,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:19,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:19,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:55:19,877 INFO L279 TraceCheckSpWp]: Computing forward predicates...