./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label26.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/Problem12_label26.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 3e2e47b78067195f514cd980cc36561e3679a03106d39ad74c0665f1ff81079a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:36:35,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:36:35,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:36:35,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:36:35,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:36:35,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:36:35,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:36:35,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:36:35,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:36:35,287 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:36:35,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:36:35,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:36:35,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:36:35,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:36:35,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:36:35,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:36:35,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:36:35,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:36:35,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:36:35,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:36:35,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:36:35,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:36:35,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:36:35,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:36:35,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:36:35,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:36:35,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:36:35,289 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 -> 3e2e47b78067195f514cd980cc36561e3679a03106d39ad74c0665f1ff81079a [2025-03-03 10:36:35,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:36:35,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:36:35,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:36:35,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:36:35,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:36:35,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label26.c [2025-03-03 10:36:36,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e918b46f4/6f6126bc267f45ea855272bd5433380c/FLAGb07fff126 [2025-03-03 10:36:37,031 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:36:37,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label26.c [2025-03-03 10:36:37,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e918b46f4/6f6126bc267f45ea855272bd5433380c/FLAGb07fff126 [2025-03-03 10:36:37,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e918b46f4/6f6126bc267f45ea855272bd5433380c [2025-03-03 10:36:37,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:36:37,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:36:37,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:36:37,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:36:37,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:36:37,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:37" (1/1) ... [2025-03-03 10:36:37,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60699757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37, skipping insertion in model container [2025-03-03 10:36:37,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:37" (1/1) ... [2025-03-03 10:36:37,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:36:37,343 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/Problem12_label26.c[5703,5716] [2025-03-03 10:36:37,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:36:37,797 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:36:37,821 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/Problem12_label26.c[5703,5716] [2025-03-03 10:36:38,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:36:38,099 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:36:38,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38 WrapperNode [2025-03-03 10:36:38,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:36:38,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:36:38,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:36:38,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:36:38,106 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:36:38" (1/1) ... [2025-03-03 10:36:38,149 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:36:38" (1/1) ... [2025-03-03 10:36:38,371 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:36:38,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:36:38,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:36:38,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:36:38,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:36:38,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38" (1/1) ... [2025-03-03 10:36:38,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38" (1/1) ... [2025-03-03 10:36:38,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38" (1/1) ... [2025-03-03 10:36:38,582 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:36:38,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38" (1/1) ... [2025-03-03 10:36:38,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38" (1/1) ... [2025-03-03 10:36:38,692 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38" (1/1) ... [2025-03-03 10:36:38,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38" (1/1) ... [2025-03-03 10:36:38,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38" (1/1) ... [2025-03-03 10:36:38,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38" (1/1) ... [2025-03-03 10:36:38,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:36:38,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:36:38,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:36:38,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:36:38,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38" (1/1) ... [2025-03-03 10:36:38,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:36:38,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:38,794 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:36:38,801 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:36:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:36:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:36:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:36:38,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:36:38,867 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:36:38,869 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:36:42,018 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:36:42,019 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:36:42,019 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:36:42,170 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:36:42,170 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:36:42,203 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:36:42,204 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:36:42,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:42 BoogieIcfgContainer [2025-03-03 10:36:42,204 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:36:42,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:36:42,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:36:42,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:36:42,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:37" (1/3) ... [2025-03-03 10:36:42,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15056c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:42, skipping insertion in model container [2025-03-03 10:36:42,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:38" (2/3) ... [2025-03-03 10:36:42,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15056c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:42, skipping insertion in model container [2025-03-03 10:36:42,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:42" (3/3) ... [2025-03-03 10:36:42,213 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label26.c [2025-03-03 10:36:42,225 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:36:42,226 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label26.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:36:42,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:36:42,307 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;@6c09e30d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:36:42,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:36:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states 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:36:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 10:36:42,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:42,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:42,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:42,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:42,326 INFO L85 PathProgramCache]: Analyzing trace with hash -159125258, now seen corresponding path program 1 times [2025-03-03 10:36:42,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:42,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937705502] [2025-03-03 10:36:42,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:42,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:42,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 10:36:42,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 10:36:42,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:42,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:42,748 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:36:42,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:42,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937705502] [2025-03-03 10:36:42,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937705502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:42,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:42,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:42,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988113650] [2025-03-03 10:36:42,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:42,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:36:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:42,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:36:42,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:42,772 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:36:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:47,722 INFO L93 Difference]: Finished difference Result 3142 states and 6126 transitions. [2025-03-03 10:36:47,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:47,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-03 10:36:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:47,743 INFO L225 Difference]: With dead ends: 3142 [2025-03-03 10:36:47,743 INFO L226 Difference]: Without dead ends: 2257 [2025-03-03 10:36:47,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:47,750 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 2219 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5678 mSolverCounterSat, 1220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 6898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1220 IncrementalHoareTripleChecker+Valid, 5678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:47,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2219 Valid, 783 Invalid, 6898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1220 Valid, 5678 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-03 10:36:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-03-03 10:36:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-03-03 10:36:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.5802304964539007) internal successors, (3565), 2256 states have internal predecessors, (3565), 0 states have call successors, (0), 0 states 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:36:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3565 transitions. [2025-03-03 10:36:47,863 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3565 transitions. Word has length 45 [2025-03-03 10:36:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:47,865 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3565 transitions. [2025-03-03 10:36:47,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:36:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3565 transitions. [2025-03-03 10:36:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 10:36:47,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:47,868 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:47,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:36:47,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:47,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1924041267, now seen corresponding path program 1 times [2025-03-03 10:36:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:47,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497276890] [2025-03-03 10:36:47,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:47,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 10:36:47,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 10:36:47,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:47,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497276890] [2025-03-03 10:36:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497276890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:48,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:48,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:48,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5790345] [2025-03-03 10:36:48,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:48,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:36:48,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:48,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:36:48,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:48,225 INFO L87 Difference]: Start difference. First operand 2257 states and 3565 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:36:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:51,291 INFO L93 Difference]: Finished difference Result 5300 states and 9213 transitions. [2025-03-03 10:36:51,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:51,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 10:36:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:51,302 INFO L225 Difference]: With dead ends: 5300 [2025-03-03 10:36:51,302 INFO L226 Difference]: Without dead ends: 3759 [2025-03-03 10:36:51,304 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:36:51,305 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:51,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 712 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:36:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2025-03-03 10:36:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2025-03-03 10:36:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3685470995210218) internal successors, (5143), 3758 states have internal predecessors, (5143), 0 states have call successors, (0), 0 states 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:36:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5143 transitions. [2025-03-03 10:36:51,359 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5143 transitions. Word has length 116 [2025-03-03 10:36:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:51,360 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5143 transitions. [2025-03-03 10:36:51,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:36:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5143 transitions. [2025-03-03 10:36:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 10:36:51,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:51,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:51,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:36:51,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:51,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1352718668, now seen corresponding path program 1 times [2025-03-03 10:36:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:51,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664622009] [2025-03-03 10:36:51,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:51,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:51,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 10:36:51,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 10:36:51,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:51,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:51,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:51,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664622009] [2025-03-03 10:36:51,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664622009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:36:51,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581802350] [2025-03-03 10:36:51,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:51,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:51,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:51,725 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:36:51,728 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:36:51,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 10:36:51,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 10:36:51,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:51,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:51,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:36:51,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:36:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 10:36:52,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:36:52,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581802350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:52,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:36:52,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:36:52,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019241143] [2025-03-03 10:36:52,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:52,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:52,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:52,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:52,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:52,069 INFO L87 Difference]: Start difference. First operand 3759 states and 5143 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:36:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:54,083 INFO L93 Difference]: Finished difference Result 9018 states and 13078 transitions. [2025-03-03 10:36:54,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:54,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 190 [2025-03-03 10:36:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:54,101 INFO L225 Difference]: With dead ends: 9018 [2025-03-03 10:36:54,102 INFO L226 Difference]: Without dead ends: 6012 [2025-03-03 10:36:54,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:54,109 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 720 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 702 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:54,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 104 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [702 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:36:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-03-03 10:36:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 5261. [2025-03-03 10:36:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.4636882129277566) internal successors, (7699), 5260 states have internal predecessors, (7699), 0 states have call successors, (0), 0 states 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:36:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 7699 transitions. [2025-03-03 10:36:54,185 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 7699 transitions. Word has length 190 [2025-03-03 10:36:54,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:54,187 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 7699 transitions. [2025-03-03 10:36:54,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:36:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 7699 transitions. [2025-03-03 10:36:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-03 10:36:54,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:54,192 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-03 10:36:54,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:36:54,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:54,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:54,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:54,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2059196889, now seen corresponding path program 1 times [2025-03-03 10:36:54,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:54,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961061063] [2025-03-03 10:36:54,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:54,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-03 10:36:54,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-03 10:36:54,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:54,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:36:54,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:54,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961061063] [2025-03-03 10:36:54,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961061063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:54,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:54,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972985892] [2025-03-03 10:36:54,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:54,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:36:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:54,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:36:54,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:54,739 INFO L87 Difference]: Start difference. First operand 5261 states and 7699 transitions. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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:36:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:57,317 INFO L93 Difference]: Finished difference Result 12812 states and 19959 transitions. [2025-03-03 10:36:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:57,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 257 [2025-03-03 10:36:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:57,339 INFO L225 Difference]: With dead ends: 12812 [2025-03-03 10:36:57,339 INFO L226 Difference]: Without dead ends: 8267 [2025-03-03 10:36:57,346 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:36:57,348 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 775 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3717 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 4259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 3717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:57,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 324 Invalid, 4259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 3717 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:36:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8267 states. [2025-03-03 10:36:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8267 to 7514. [2025-03-03 10:36:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7514 states, 7513 states have (on average 1.4243311593238386) internal successors, (10701), 7513 states have internal predecessors, (10701), 0 states have call successors, (0), 0 states 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:36:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7514 states to 7514 states and 10701 transitions. [2025-03-03 10:36:57,459 INFO L78 Accepts]: Start accepts. Automaton has 7514 states and 10701 transitions. Word has length 257 [2025-03-03 10:36:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:57,460 INFO L471 AbstractCegarLoop]: Abstraction has 7514 states and 10701 transitions. [2025-03-03 10:36:57,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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:36:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 7514 states and 10701 transitions. [2025-03-03 10:36:57,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-03 10:36:57,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:57,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:36:57,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:36:57,464 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:57,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1636603646, now seen corresponding path program 1 times [2025-03-03 10:36:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:57,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523737507] [2025-03-03 10:36:57,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:57,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-03 10:36:57,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-03 10:36:57,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:57,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-03 10:36:57,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:57,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523737507] [2025-03-03 10:36:57,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523737507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:57,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:57,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:36:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348787811] [2025-03-03 10:36:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:57,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:57,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:57,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:57,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:57,616 INFO L87 Difference]: Start difference. First operand 7514 states and 10701 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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:36:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:59,808 INFO L93 Difference]: Finished difference Result 18030 states and 26024 transitions. [2025-03-03 10:36:59,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:59,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 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 279 [2025-03-03 10:36:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:59,833 INFO L225 Difference]: With dead ends: 18030 [2025-03-03 10:36:59,833 INFO L226 Difference]: Without dead ends: 11269 [2025-03-03 10:36:59,841 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:36:59,841 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 694 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 782 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 782 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:59,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 422 Invalid, 2749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [782 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:36:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11269 states. [2025-03-03 10:36:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11269 to 11269. [2025-03-03 10:36:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.2212460063897763) internal successors, (13761), 11268 states have internal predecessors, (13761), 0 states have call successors, (0), 0 states 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:36:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13761 transitions. [2025-03-03 10:36:59,991 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 13761 transitions. Word has length 279 [2025-03-03 10:36:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:59,993 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 13761 transitions. [2025-03-03 10:36:59,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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:36:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 13761 transitions. [2025-03-03 10:36:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-03 10:36:59,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:59,999 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:36:59,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:37:00,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:00,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:00,002 INFO L85 PathProgramCache]: Analyzing trace with hash -440348827, now seen corresponding path program 1 times [2025-03-03 10:37:00,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:00,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766829856] [2025-03-03 10:37:00,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:00,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:00,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-03 10:37:00,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-03 10:37:00,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:00,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:37:00,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:00,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766829856] [2025-03-03 10:37:00,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766829856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:00,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:00,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041170828] [2025-03-03 10:37:00,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:00,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:00,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:00,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:00,412 INFO L87 Difference]: Start difference. First operand 11269 states and 13761 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states 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:37:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:02,405 INFO L93 Difference]: Finished difference Result 26291 states and 32977 transitions. [2025-03-03 10:37:02,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:02,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 358 [2025-03-03 10:37:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:02,430 INFO L225 Difference]: With dead ends: 26291 [2025-03-03 10:37:02,430 INFO L226 Difference]: Without dead ends: 15775 [2025-03-03 10:37:02,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:37:02,441 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 780 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 840 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 840 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:02,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 105 Invalid, 3006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [840 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:37:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2025-03-03 10:37:02,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 15775. [2025-03-03 10:37:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2434385697984025) internal successors, (19614), 15774 states have internal predecessors, (19614), 0 states have call successors, (0), 0 states 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:37:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 19614 transitions. [2025-03-03 10:37:02,610 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 19614 transitions. Word has length 358 [2025-03-03 10:37:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:02,610 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 19614 transitions. [2025-03-03 10:37:02,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states 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:37:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 19614 transitions. [2025-03-03 10:37:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-03 10:37:02,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:02,616 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:02,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:37:02,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:02,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1280293969, now seen corresponding path program 1 times [2025-03-03 10:37:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132135833] [2025-03-03 10:37:02,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:02,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-03 10:37:02,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-03 10:37:02,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:02,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:37:02,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132135833] [2025-03-03 10:37:02,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132135833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:02,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:02,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:02,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521985921] [2025-03-03 10:37:02,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:02,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:02,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:02,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:02,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:02,807 INFO L87 Difference]: Start difference. First operand 15775 states and 19614 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:04,905 INFO L93 Difference]: Finished difference Result 34552 states and 43511 transitions. [2025-03-03 10:37:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:04,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 362 [2025-03-03 10:37:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:04,929 INFO L225 Difference]: With dead ends: 34552 [2025-03-03 10:37:04,929 INFO L226 Difference]: Without dead ends: 19530 [2025-03-03 10:37:04,943 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:37:04,943 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 761 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:04,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 235 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:37:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2025-03-03 10:37:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 19530. [2025-03-03 10:37:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19530 states, 19529 states have (on average 1.2406165190229914) internal successors, (24228), 19529 states have internal predecessors, (24228), 0 states have call successors, (0), 0 states 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:37:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19530 states to 19530 states and 24228 transitions. [2025-03-03 10:37:05,116 INFO L78 Accepts]: Start accepts. Automaton has 19530 states and 24228 transitions. Word has length 362 [2025-03-03 10:37:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:05,117 INFO L471 AbstractCegarLoop]: Abstraction has 19530 states and 24228 transitions. [2025-03-03 10:37:05,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 19530 states and 24228 transitions. [2025-03-03 10:37:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-03 10:37:05,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:05,121 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:05,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:37:05,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:05,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:05,121 INFO L85 PathProgramCache]: Analyzing trace with hash -360268440, now seen corresponding path program 1 times [2025-03-03 10:37:05,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:05,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308372265] [2025-03-03 10:37:05,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:05,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:05,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-03 10:37:05,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-03 10:37:05,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:05,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 10:37:05,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:05,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308372265] [2025-03-03 10:37:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308372265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:05,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:05,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641740839] [2025-03-03 10:37:05,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:05,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:05,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:05,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:05,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:05,282 INFO L87 Difference]: Start difference. First operand 19530 states and 24228 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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:37:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:07,608 INFO L93 Difference]: Finished difference Result 54829 states and 68728 transitions. [2025-03-03 10:37:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:07,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 373 [2025-03-03 10:37:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:07,654 INFO L225 Difference]: With dead ends: 54829 [2025-03-03 10:37:07,654 INFO L226 Difference]: Without dead ends: 36052 [2025-03-03 10:37:07,675 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:37:07,676 INFO L435 NwaCegarLoop]: 1352 mSDtfsCounter, 726 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:07,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1360 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:37:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36052 states. [2025-03-03 10:37:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36052 to 34550. [2025-03-03 10:37:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34550 states, 34549 states have (on average 1.1807288199369013) internal successors, (40793), 34549 states have internal predecessors, (40793), 0 states have call successors, (0), 0 states 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:37:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34550 states to 34550 states and 40793 transitions. [2025-03-03 10:37:07,984 INFO L78 Accepts]: Start accepts. Automaton has 34550 states and 40793 transitions. Word has length 373 [2025-03-03 10:37:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:07,985 INFO L471 AbstractCegarLoop]: Abstraction has 34550 states and 40793 transitions. [2025-03-03 10:37:07,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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:37:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 34550 states and 40793 transitions. [2025-03-03 10:37:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-03 10:37:07,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:07,995 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:07,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:37:07,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:07,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 904242442, now seen corresponding path program 1 times [2025-03-03 10:37:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644235623] [2025-03-03 10:37:07,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:08,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-03 10:37:08,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-03 10:37:08,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:08,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-03 10:37:08,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:08,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644235623] [2025-03-03 10:37:08,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644235623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:08,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:08,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:08,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990764773] [2025-03-03 10:37:08,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:08,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:08,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:08,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:08,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:08,326 INFO L87 Difference]: Start difference. First operand 34550 states and 40793 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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:37:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:10,834 INFO L93 Difference]: Finished difference Result 84869 states and 100273 transitions. [2025-03-03 10:37:10,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:10,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2025-03-03 10:37:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:10,886 INFO L225 Difference]: With dead ends: 84869 [2025-03-03 10:37:10,887 INFO L226 Difference]: Without dead ends: 51072 [2025-03-03 10:37:10,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:10,912 INFO L435 NwaCegarLoop]: 1352 mSDtfsCounter, 635 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:10,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1360 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2699 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:37:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51072 states. [2025-03-03 10:37:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51072 to 49570. [2025-03-03 10:37:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49570 states, 49569 states have (on average 1.170993968004196) internal successors, (58045), 49569 states have internal predecessors, (58045), 0 states have call successors, (0), 0 states 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:37:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49570 states to 49570 states and 58045 transitions. [2025-03-03 10:37:11,337 INFO L78 Accepts]: Start accepts. Automaton has 49570 states and 58045 transitions. Word has length 462 [2025-03-03 10:37:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:11,337 INFO L471 AbstractCegarLoop]: Abstraction has 49570 states and 58045 transitions. [2025-03-03 10:37:11,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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:37:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 49570 states and 58045 transitions. [2025-03-03 10:37:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 10:37:11,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:11,419 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:11,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:37:11,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:11,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash -989465132, now seen corresponding path program 1 times [2025-03-03 10:37:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:11,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326147372] [2025-03-03 10:37:11,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:11,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:11,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 10:37:11,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 10:37:11,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:11,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:37:11,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:11,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326147372] [2025-03-03 10:37:11,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326147372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:11,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:11,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:11,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101196435] [2025-03-03 10:37:11,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:11,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:11,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:11,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:11,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:11,640 INFO L87 Difference]: Start difference. First operand 49570 states and 58045 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:13,870 INFO L93 Difference]: Finished difference Result 122419 states and 145479 transitions. [2025-03-03 10:37:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 466 [2025-03-03 10:37:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:13,942 INFO L225 Difference]: With dead ends: 122419 [2025-03-03 10:37:13,942 INFO L226 Difference]: Without dead ends: 69847 [2025-03-03 10:37:13,978 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:37:13,978 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 711 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:13,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1266 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:37:14,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69847 states. [2025-03-03 10:37:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69847 to 62337. [2025-03-03 10:37:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62337 states, 62336 states have (on average 1.1526244866529773) internal successors, (71850), 62336 states have internal predecessors, (71850), 0 states have call successors, (0), 0 states 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:37:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62337 states to 62337 states and 71850 transitions. [2025-03-03 10:37:14,600 INFO L78 Accepts]: Start accepts. Automaton has 62337 states and 71850 transitions. Word has length 466 [2025-03-03 10:37:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:14,600 INFO L471 AbstractCegarLoop]: Abstraction has 62337 states and 71850 transitions. [2025-03-03 10:37:14,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:14,601 INFO L276 IsEmpty]: Start isEmpty. Operand 62337 states and 71850 transitions. [2025-03-03 10:37:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-03 10:37:14,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:14,610 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:37:14,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:37:14,611 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:14,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1173232233, now seen corresponding path program 1 times [2025-03-03 10:37:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486547383] [2025-03-03 10:37:14,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:14,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:14,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 10:37:14,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 10:37:14,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:14,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 626 proven. 14 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 10:37:15,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:15,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486547383] [2025-03-03 10:37:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486547383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:37:15,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199884773] [2025-03-03 10:37:15,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:15,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:37:15,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:37:15,236 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:37:15,237 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:37:15,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 10:37:15,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 10:37:15,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:15,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:15,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:37:15,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:37:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-03 10:37:15,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:37:15,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199884773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:15,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:37:15,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:37:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127929896] [2025-03-03 10:37:15,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:15,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:15,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:15,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:15,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:37:15,481 INFO L87 Difference]: Start difference. First operand 62337 states and 71850 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:37:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:17,565 INFO L93 Difference]: Finished difference Result 123921 states and 142942 transitions. [2025-03-03 10:37:17,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:17,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 532 [2025-03-03 10:37:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:17,631 INFO L225 Difference]: With dead ends: 123921 [2025-03-03 10:37:17,631 INFO L226 Difference]: Without dead ends: 62337 [2025-03-03 10:37:17,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:37:17,672 INFO L435 NwaCegarLoop]: 1294 mSDtfsCounter, 685 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:17,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1302 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:37:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62337 states. [2025-03-03 10:37:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62337 to 60084. [2025-03-03 10:37:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60084 states, 60083 states have (on average 1.1125110264134614) internal successors, (66843), 60083 states have internal predecessors, (66843), 0 states have call successors, (0), 0 states 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:37:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60084 states to 60084 states and 66843 transitions. [2025-03-03 10:37:18,506 INFO L78 Accepts]: Start accepts. Automaton has 60084 states and 66843 transitions. Word has length 532 [2025-03-03 10:37:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:18,506 INFO L471 AbstractCegarLoop]: Abstraction has 60084 states and 66843 transitions. [2025-03-03 10:37:18,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:37:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 60084 states and 66843 transitions. [2025-03-03 10:37:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-03-03 10:37:18,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:18,520 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:18,526 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:37:18,721 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,SelfDestructingSolverStorable10 [2025-03-03 10:37:18,721 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:18,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:18,722 INFO L85 PathProgramCache]: Analyzing trace with hash -59049733, now seen corresponding path program 1 times [2025-03-03 10:37:18,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:18,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998651655] [2025-03-03 10:37:18,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:18,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:18,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-03 10:37:18,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-03 10:37:18,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:18,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 128 proven. 14 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2025-03-03 10:37:19,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998651655] [2025-03-03 10:37:19,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998651655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:37:19,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232297859] [2025-03-03 10:37:19,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:19,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:37:19,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:37:19,258 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:37:19,259 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:37:19,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-03 10:37:19,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-03 10:37:19,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:19,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:19,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:37:19,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:37:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-03 10:37:19,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:37:19,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232297859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:19,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:37:19,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:37:19,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970728996] [2025-03-03 10:37:19,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:19,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:19,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:19,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:37:19,758 INFO L87 Difference]: Start difference. First operand 60084 states and 66843 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:37:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:21,991 INFO L93 Difference]: Finished difference Result 119415 states and 132928 transitions. [2025-03-03 10:37:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:21,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 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 546 [2025-03-03 10:37:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:22,051 INFO L225 Difference]: With dead ends: 119415 [2025-03-03 10:37:22,051 INFO L226 Difference]: Without dead ends: 60084 [2025-03-03 10:37:22,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:37:22,076 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 534 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2202 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 2688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 2202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:22,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 403 Invalid, 2688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 2202 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:37:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60084 states. [2025-03-03 10:37:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60084 to 58582. [2025-03-03 10:37:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58582 states, 58581 states have (on average 1.0728393165019374) internal successors, (62848), 58581 states have internal predecessors, (62848), 0 states have call successors, (0), 0 states 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:37:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58582 states to 58582 states and 62848 transitions. [2025-03-03 10:37:22,536 INFO L78 Accepts]: Start accepts. Automaton has 58582 states and 62848 transitions. Word has length 546 [2025-03-03 10:37:22,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:22,536 INFO L471 AbstractCegarLoop]: Abstraction has 58582 states and 62848 transitions. [2025-03-03 10:37:22,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:37:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 58582 states and 62848 transitions. [2025-03-03 10:37:22,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-03-03 10:37:22,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:22,552 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:22,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:37:22,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:37:22,753 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:22,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:22,753 INFO L85 PathProgramCache]: Analyzing trace with hash 823964188, now seen corresponding path program 1 times [2025-03-03 10:37:22,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:22,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086933071] [2025-03-03 10:37:22,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:22,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-03-03 10:37:22,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-03-03 10:37:22,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:22,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-03-03 10:37:23,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:23,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086933071] [2025-03-03 10:37:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086933071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:23,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888903882] [2025-03-03 10:37:23,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:23,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:37:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:23,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:37:23,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:37:23,247 INFO L87 Difference]: Start difference. First operand 58582 states and 62848 transitions. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states 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:37:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:26,876 INFO L93 Difference]: Finished difference Result 176491 states and 190477 transitions. [2025-03-03 10:37:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:37:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 613 [2025-03-03 10:37:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:27,018 INFO L225 Difference]: With dead ends: 176491 [2025-03-03 10:37:27,018 INFO L226 Difference]: Without dead ends: 118662 [2025-03-03 10:37:27,066 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:37:27,066 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 1611 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4981 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 4981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:27,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 57 Invalid, 5503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 4981 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-03 10:37:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118662 states. [2025-03-03 10:37:27,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118662 to 117911. [2025-03-03 10:37:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117911 states, 117910 states have (on average 1.076142820795522) internal successors, (126888), 117910 states have internal predecessors, (126888), 0 states have call successors, (0), 0 states 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:37:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117911 states to 117911 states and 126888 transitions. [2025-03-03 10:37:28,126 INFO L78 Accepts]: Start accepts. Automaton has 117911 states and 126888 transitions. Word has length 613 [2025-03-03 10:37:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:28,126 INFO L471 AbstractCegarLoop]: Abstraction has 117911 states and 126888 transitions. [2025-03-03 10:37:28,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states 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:37:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 117911 states and 126888 transitions. [2025-03-03 10:37:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2025-03-03 10:37:28,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:28,146 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:28,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:37:28,146 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:28,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash 178462051, now seen corresponding path program 1 times [2025-03-03 10:37:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:28,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948787894] [2025-03-03 10:37:28,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:28,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-03-03 10:37:28,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-03-03 10:37:28,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:28,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 568 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-03 10:37:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948787894] [2025-03-03 10:37:28,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948787894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:28,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:28,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:28,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198465109] [2025-03-03 10:37:28,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:28,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:28,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:28,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:28,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:28,562 INFO L87 Difference]: Start difference. First operand 117911 states and 126888 transitions. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states 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:37:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:31,050 INFO L93 Difference]: Finished difference Result 241077 states and 259192 transitions. [2025-03-03 10:37:31,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:31,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 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 620 [2025-03-03 10:37:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:31,205 INFO L225 Difference]: With dead ends: 241077 [2025-03-03 10:37:31,205 INFO L226 Difference]: Without dead ends: 123919 [2025-03-03 10:37:31,277 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:37:31,277 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 735 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:31,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 186 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:37:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123919 states. [2025-03-03 10:37:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123919 to 117911. [2025-03-03 10:37:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117911 states, 117910 states have (on average 1.071232295818845) internal successors, (126309), 117910 states have internal predecessors, (126309), 0 states have call successors, (0), 0 states 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:37:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117911 states to 117911 states and 126309 transitions. [2025-03-03 10:37:32,411 INFO L78 Accepts]: Start accepts. Automaton has 117911 states and 126309 transitions. Word has length 620 [2025-03-03 10:37:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:32,412 INFO L471 AbstractCegarLoop]: Abstraction has 117911 states and 126309 transitions. [2025-03-03 10:37:32,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states 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:37:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 117911 states and 126309 transitions. [2025-03-03 10:37:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 10:37:32,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:32,427 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:32,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:37:32,428 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:32,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash -365608488, now seen corresponding path program 1 times [2025-03-03 10:37:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:32,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364288679] [2025-03-03 10:37:32,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:32,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 10:37:32,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 10:37:32,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:32,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-03 10:37:32,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364288679] [2025-03-03 10:37:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364288679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:32,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492651443] [2025-03-03 10:37:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:32,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:32,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:32,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:32,613 INFO L87 Difference]: Start difference. First operand 117911 states and 126309 transitions. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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:37:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:35,307 INFO L93 Difference]: Finished difference Result 312422 states and 334578 transitions. [2025-03-03 10:37:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:35,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 658 [2025-03-03 10:37:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:35,506 INFO L225 Difference]: With dead ends: 312422 [2025-03-03 10:37:35,506 INFO L226 Difference]: Without dead ends: 195264 [2025-03-03 10:37:35,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:35,584 INFO L435 NwaCegarLoop]: 1275 mSDtfsCounter, 483 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:35,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1283 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:37:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195264 states. [2025-03-03 10:37:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195264 to 173485. [2025-03-03 10:37:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173485 states, 173484 states have (on average 1.0587258767379124) internal successors, (183672), 173484 states have internal predecessors, (183672), 0 states have call successors, (0), 0 states 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:37:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173485 states to 173485 states and 183672 transitions. [2025-03-03 10:37:37,802 INFO L78 Accepts]: Start accepts. Automaton has 173485 states and 183672 transitions. Word has length 658 [2025-03-03 10:37:37,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:37,803 INFO L471 AbstractCegarLoop]: Abstraction has 173485 states and 183672 transitions. [2025-03-03 10:37:37,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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:37:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 173485 states and 183672 transitions. [2025-03-03 10:37:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2025-03-03 10:37:37,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:37,842 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:37,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:37:37,842 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:37,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1917030191, now seen corresponding path program 1 times [2025-03-03 10:37:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:37,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407972499] [2025-03-03 10:37:37,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:37,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:37,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 774 statements into 1 equivalence classes. [2025-03-03 10:37:37,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 774 of 774 statements. [2025-03-03 10:37:37,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:37,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-03 10:37:38,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:38,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407972499] [2025-03-03 10:37:38,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407972499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:38,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:38,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:38,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221458605] [2025-03-03 10:37:38,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:38,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:38,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:38,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:38,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:38,629 INFO L87 Difference]: Start difference. First operand 173485 states and 183672 transitions. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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:37:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:41,032 INFO L93 Difference]: Finished difference Result 346217 states and 366586 transitions. [2025-03-03 10:37:41,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:41,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 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 774 [2025-03-03 10:37:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:41,225 INFO L225 Difference]: With dead ends: 346217 [2025-03-03 10:37:41,225 INFO L226 Difference]: Without dead ends: 173485 [2025-03-03 10:37:41,316 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:37:41,317 INFO L435 NwaCegarLoop]: 1164 mSDtfsCounter, 442 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:41,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1172 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:37:41,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173485 states. [2025-03-03 10:37:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173485 to 168979. [2025-03-03 10:37:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168979 states, 168978 states have (on average 1.0454141959308312) internal successors, (176652), 168978 states have internal predecessors, (176652), 0 states have call successors, (0), 0 states 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:37:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168979 states to 168979 states and 176652 transitions. [2025-03-03 10:37:43,638 INFO L78 Accepts]: Start accepts. Automaton has 168979 states and 176652 transitions. Word has length 774 [2025-03-03 10:37:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:43,638 INFO L471 AbstractCegarLoop]: Abstraction has 168979 states and 176652 transitions. [2025-03-03 10:37:43,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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:37:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 168979 states and 176652 transitions. [2025-03-03 10:37:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 807 [2025-03-03 10:37:43,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:43,665 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:43,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:37:43,665 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:43,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash -984565286, now seen corresponding path program 1 times [2025-03-03 10:37:43,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:43,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588108896] [2025-03-03 10:37:43,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:43,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:43,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 806 statements into 1 equivalence classes. [2025-03-03 10:37:43,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 806 of 806 statements. [2025-03-03 10:37:43,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:43,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-03 10:37:44,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:44,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588108896] [2025-03-03 10:37:44,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588108896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:44,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:44,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:44,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855947658] [2025-03-03 10:37:44,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:44,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:37:44,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:44,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:37:44,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:37:44,595 INFO L87 Difference]: Start difference. First operand 168979 states and 176652 transitions. Second operand has 4 states, 4 states have (on average 136.75) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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:37:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:48,518 INFO L93 Difference]: Finished difference Result 334952 states and 351350 transitions. [2025-03-03 10:37:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:37:48,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 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 806 [2025-03-03 10:37:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:48,754 INFO L225 Difference]: With dead ends: 334952 [2025-03-03 10:37:48,754 INFO L226 Difference]: Without dead ends: 195264 [2025-03-03 10:37:48,837 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:37:48,837 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 1546 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4526 mSolverCounterSat, 601 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 4526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:48,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 73 Invalid, 5127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [601 Valid, 4526 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:37:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195264 states. [2025-03-03 10:37:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195264 to 171232. [2025-03-03 10:37:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171232 states, 171231 states have (on average 1.0453188966951077) internal successors, (178991), 171231 states have internal predecessors, (178991), 0 states have call successors, (0), 0 states 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:37:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171232 states to 171232 states and 178991 transitions. [2025-03-03 10:37:50,638 INFO L78 Accepts]: Start accepts. Automaton has 171232 states and 178991 transitions. Word has length 806 [2025-03-03 10:37:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:50,639 INFO L471 AbstractCegarLoop]: Abstraction has 171232 states and 178991 transitions. [2025-03-03 10:37:50,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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:37:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 171232 states and 178991 transitions. [2025-03-03 10:37:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2025-03-03 10:37:50,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:50,669 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:37:50,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:37:50,670 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:50,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1110828158, now seen corresponding path program 1 times [2025-03-03 10:37:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260460346] [2025-03-03 10:37:50,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:50,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 879 statements into 1 equivalence classes. [2025-03-03 10:37:50,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 879 of 879 statements. [2025-03-03 10:37:50,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:50,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1492 backedges. 1158 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-03 10:37:51,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:51,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260460346] [2025-03-03 10:37:51,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260460346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:51,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:51,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:51,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996423936] [2025-03-03 10:37:51,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:51,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:51,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:51,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:51,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:51,569 INFO L87 Difference]: Start difference. First operand 171232 states and 178991 transitions. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:37:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:54,031 INFO L93 Difference]: Finished difference Result 358984 states and 374974 transitions. [2025-03-03 10:37:54,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:54,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 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 879 [2025-03-03 10:37:54,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:54,485 INFO L225 Difference]: With dead ends: 358984 [2025-03-03 10:37:54,486 INFO L226 Difference]: Without dead ends: 188505 [2025-03-03 10:37:54,556 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:37:54,556 INFO L435 NwaCegarLoop]: 1265 mSDtfsCounter, 591 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2433 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:54,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1273 Invalid, 2574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2433 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:37:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188505 states. [2025-03-03 10:37:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188505 to 183248. [2025-03-03 10:37:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183248 states, 183247 states have (on average 1.043253095548631) internal successors, (191173), 183247 states have internal predecessors, (191173), 0 states have call successors, (0), 0 states 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:37:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183248 states to 183248 states and 191173 transitions. [2025-03-03 10:37:56,658 INFO L78 Accepts]: Start accepts. Automaton has 183248 states and 191173 transitions. Word has length 879 [2025-03-03 10:37:56,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:56,658 INFO L471 AbstractCegarLoop]: Abstraction has 183248 states and 191173 transitions. [2025-03-03 10:37:56,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:37:56,658 INFO L276 IsEmpty]: Start isEmpty. Operand 183248 states and 191173 transitions. [2025-03-03 10:37:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2025-03-03 10:37:56,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:56,698 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:37:56,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:37:56,699 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:56,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash 471181854, now seen corresponding path program 1 times [2025-03-03 10:37:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126055319] [2025-03-03 10:37:56,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:56,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 897 statements into 1 equivalence classes. [2025-03-03 10:37:56,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 897 of 897 statements. [2025-03-03 10:37:56,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:56,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2025-03-03 10:37:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126055319] [2025-03-03 10:37:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126055319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:57,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:57,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580246331] [2025-03-03 10:37:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:57,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:57,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:57,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:57,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:57,250 INFO L87 Difference]: Start difference. First operand 183248 states and 191173 transitions. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states 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:37:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:59,915 INFO L93 Difference]: Finished difference Result 378510 states and 395904 transitions. [2025-03-03 10:37:59,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:59,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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 897 [2025-03-03 10:37:59,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:00,196 INFO L225 Difference]: With dead ends: 378510 [2025-03-03 10:38:00,197 INFO L226 Difference]: Without dead ends: 226806 [2025-03-03 10:38:00,299 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:38:00,299 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 830 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:00,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1337 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2490 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:38:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226806 states.