./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label01.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 f26c9b68539fd7e45903345f01b5b0bdfd3aa591442c893b5a75fc637a7ed516 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:27:11,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:27:11,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:27:11,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:27:11,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:27:11,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:27:11,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:27:11,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:27:11,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:27:11,296 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:27:11,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:27:11,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:27:11,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:27:11,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:27:11,297 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:27:11,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:27:11,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:27:11,297 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:27:11,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:27:11,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:27:11,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:27:11,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:27:11,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:27:11,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:27:11,298 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:27:11,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:27:11,298 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:27:11,298 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:27:11,299 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:27:11,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:27:11,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:27:11,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:27:11,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:27:11,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:27:11,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:27:11,300 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:27:11,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:27:11,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:27:11,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:27:11,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:27:11,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:27:11,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:27:11,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:27:11,300 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 -> f26c9b68539fd7e45903345f01b5b0bdfd3aa591442c893b5a75fc637a7ed516 [2025-03-16 15:27:11,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:27:11,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:27:11,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:27:11,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:27:11,534 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:27:11,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label01.c [2025-03-16 15:27:12,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b05038b/7c9a11c139464b7c86895475107d277f/FLAG43439d18e [2025-03-16 15:27:13,181 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:27:13,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label01.c [2025-03-16 15:27:13,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b05038b/7c9a11c139464b7c86895475107d277f/FLAG43439d18e [2025-03-16 15:27:13,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b05038b/7c9a11c139464b7c86895475107d277f [2025-03-16 15:27:13,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:27:13,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:27:13,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:27:13,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:27:13,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:27:13,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:27:13" (1/1) ... [2025-03-16 15:27:13,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c18e713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:13, skipping insertion in model container [2025-03-16 15:27:13,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:27:13" (1/1) ... [2025-03-16 15:27:13,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:27:13,622 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/Problem19_label01.c[8162,8175] [2025-03-16 15:27:14,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:27:14,286 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:27:14,305 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/Problem19_label01.c[8162,8175] [2025-03-16 15:27:14,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:27:14,755 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:27:14,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14 WrapperNode [2025-03-16 15:27:14,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:27:14,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:27:14,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:27:14,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:27:14,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:14,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:15,315 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-16 15:27:15,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:27:15,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:27:15,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:27:15,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:27:15,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:15,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:15,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:15,808 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:27:15,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:15,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:16,114 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:16,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:16,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:16,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:16,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:27:16,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:27:16,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:27:16,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:27:16,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (1/1) ... [2025-03-16 15:27:16,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:27:16,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:27:16,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:27:16,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:27:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:27:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:27:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:27:16,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:27:16,382 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:27:16,384 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:27:22,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-16 15:27:22,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-16 15:27:22,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-16 15:27:22,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-16 15:27:22,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-16 15:27:22,227 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-16 15:27:22,227 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:27:22,259 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:27:22,260 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:27:22,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:27:22 BoogieIcfgContainer [2025-03-16 15:27:22,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:27:22,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:27:22,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:27:22,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:27:22,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:27:13" (1/3) ... [2025-03-16 15:27:22,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6f8c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:27:22, skipping insertion in model container [2025-03-16 15:27:22,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:27:14" (2/3) ... [2025-03-16 15:27:22,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6f8c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:27:22, skipping insertion in model container [2025-03-16 15:27:22,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:27:22" (3/3) ... [2025-03-16 15:27:22,267 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label01.c [2025-03-16 15:27:22,279 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:27:22,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label01.c that has 1 procedures, 1687 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:27:22,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:27:22,363 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;@21a081cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:27:22,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:27:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 15:27:22,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:22,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:27:22,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:22,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:22,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1126071072, now seen corresponding path program 1 times [2025-03-16 15:27:22,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:22,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627711397] [2025-03-16 15:27:22,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:22,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:22,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 15:27:22,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 15:27:22,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:22,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:27:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627711397] [2025-03-16 15:27:22,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627711397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:22,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:22,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:27:22,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115732161] [2025-03-16 15:27:22,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:22,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:27:22,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:22,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:27:22,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:27:22,536 INFO L87 Difference]: Start difference. First operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:22,621 INFO L93 Difference]: Finished difference Result 3373 states and 6405 transitions. [2025-03-16 15:27:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:27:22,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-16 15:27:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:22,645 INFO L225 Difference]: With dead ends: 3373 [2025-03-16 15:27:22,645 INFO L226 Difference]: Without dead ends: 1684 [2025-03-16 15:27:22,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:27:22,658 INFO L435 NwaCegarLoop]: 3141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:22,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:27:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-16 15:27:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2025-03-16 15:27:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2025-03-16 15:27:22,748 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 62 [2025-03-16 15:27:22,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:22,748 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2025-03-16 15:27:22,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2025-03-16 15:27:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 15:27:22,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:22,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:27:22,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:27:22,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:22,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:22,751 INFO L85 PathProgramCache]: Analyzing trace with hash 165782817, now seen corresponding path program 1 times [2025-03-16 15:27:22,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:22,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337924673] [2025-03-16 15:27:22,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:22,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:22,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 15:27:22,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 15:27:22,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:22,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:27:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:23,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337924673] [2025-03-16 15:27:23,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337924673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086279308] [2025-03-16 15:27:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:23,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:27:23,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:23,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:27:23,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:27:23,150 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:32,749 INFO L93 Difference]: Finished difference Result 6149 states and 11654 transitions. [2025-03-16 15:27:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:27:32,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-16 15:27:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:32,765 INFO L225 Difference]: With dead ends: 6149 [2025-03-16 15:27:32,766 INFO L226 Difference]: Without dead ends: 4466 [2025-03-16 15:27:32,768 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-16 15:27:32,769 INFO L435 NwaCegarLoop]: 1753 mSDtfsCounter, 4201 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 10667 mSolverCounterSat, 2237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4201 SdHoareTripleChecker+Valid, 2025 SdHoareTripleChecker+Invalid, 12904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2237 IncrementalHoareTripleChecker+Valid, 10667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:32,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4201 Valid, 2025 Invalid, 12904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2237 Valid, 10667 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2025-03-16 15:27:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4466 states. [2025-03-16 15:27:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4466 to 4464. [2025-03-16 15:27:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4464 states, 4463 states have (on average 1.5646426170737173) internal successors, (6983), 4463 states have internal predecessors, (6983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4464 states to 4464 states and 6983 transitions. [2025-03-16 15:27:32,843 INFO L78 Accepts]: Start accepts. Automaton has 4464 states and 6983 transitions. Word has length 62 [2025-03-16 15:27:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:32,843 INFO L471 AbstractCegarLoop]: Abstraction has 4464 states and 6983 transitions. [2025-03-16 15:27:32,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4464 states and 6983 transitions. [2025-03-16 15:27:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-16 15:27:32,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:32,848 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:27:32,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:27:32,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:32,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash -709009122, now seen corresponding path program 1 times [2025-03-16 15:27:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:32,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568319822] [2025-03-16 15:27:32,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:32,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-16 15:27:32,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-16 15:27:32,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:32,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:27:33,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:33,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568319822] [2025-03-16 15:27:33,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568319822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:33,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:33,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224088562] [2025-03-16 15:27:33,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:33,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:27:33,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:33,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:27:33,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:27:33,649 INFO L87 Difference]: Start difference. First operand 4464 states and 6983 transitions. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:40,938 INFO L93 Difference]: Finished difference Result 11707 states and 20175 transitions. [2025-03-16 15:27:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:27:40,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2025-03-16 15:27:40,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:40,961 INFO L225 Difference]: With dead ends: 11707 [2025-03-16 15:27:40,961 INFO L226 Difference]: Without dead ends: 8609 [2025-03-16 15:27:40,964 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-16 15:27:40,965 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 3757 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9457 mSolverCounterSat, 1336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3757 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 10793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1336 IncrementalHoareTripleChecker+Valid, 9457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:40,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3757 Valid, 2160 Invalid, 10793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1336 Valid, 9457 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-03-16 15:27:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8609 states. [2025-03-16 15:27:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8609 to 8593. [2025-03-16 15:27:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8593 states, 8592 states have (on average 1.3482309124767224) internal successors, (11584), 8592 states have internal predecessors, (11584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8593 states to 8593 states and 11584 transitions. [2025-03-16 15:27:41,074 INFO L78 Accepts]: Start accepts. Automaton has 8593 states and 11584 transitions. Word has length 269 [2025-03-16 15:27:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:41,076 INFO L471 AbstractCegarLoop]: Abstraction has 8593 states and 11584 transitions. [2025-03-16 15:27:41,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 8593 states and 11584 transitions. [2025-03-16 15:27:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-16 15:27:41,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:41,082 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:27:41,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:27:41,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:41,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1247155532, now seen corresponding path program 1 times [2025-03-16 15:27:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:41,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725716826] [2025-03-16 15:27:41,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:41,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:41,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-16 15:27:41,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-16 15:27:41,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:41,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:27:41,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:41,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725716826] [2025-03-16 15:27:41,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725716826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:41,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:41,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:41,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734764835] [2025-03-16 15:27:41,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:41,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:27:41,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:41,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:27:41,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:27:41,514 INFO L87 Difference]: Start difference. First operand 8593 states and 11584 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:46,094 INFO L93 Difference]: Finished difference Result 14486 states and 20450 transitions. [2025-03-16 15:27:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:27:46,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 297 [2025-03-16 15:27:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:46,113 INFO L225 Difference]: With dead ends: 14486 [2025-03-16 15:27:46,113 INFO L226 Difference]: Without dead ends: 8593 [2025-03-16 15:27:46,118 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-16 15:27:46,119 INFO L435 NwaCegarLoop]: 1774 mSDtfsCounter, 1138 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 7325 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:46,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2115 Invalid, 7333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7325 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:27:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8593 states. [2025-03-16 15:27:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8593 to 8593. [2025-03-16 15:27:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8593 states, 8592 states have (on average 1.3467178770949721) internal successors, (11571), 8592 states have internal predecessors, (11571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8593 states to 8593 states and 11571 transitions. [2025-03-16 15:27:46,238 INFO L78 Accepts]: Start accepts. Automaton has 8593 states and 11571 transitions. Word has length 297 [2025-03-16 15:27:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:46,238 INFO L471 AbstractCegarLoop]: Abstraction has 8593 states and 11571 transitions. [2025-03-16 15:27:46,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 8593 states and 11571 transitions. [2025-03-16 15:27:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2025-03-16 15:27:46,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:46,248 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:27:46,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:27:46,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:46,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:46,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1079142431, now seen corresponding path program 1 times [2025-03-16 15:27:46,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:46,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650817992] [2025-03-16 15:27:46,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:46,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:46,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-03-16 15:27:46,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-03-16 15:27:46,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:46,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 121 proven. 43 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 15:27:46,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650817992] [2025-03-16 15:27:46,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650817992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:27:46,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224629746] [2025-03-16 15:27:46,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:46,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:27:46,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:27:46,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:27:46,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:27:46,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-03-16 15:27:47,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-03-16 15:27:47,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:47,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:47,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:27:47,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:27:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:27:47,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:27:47,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224629746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:47,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:27:47,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 15:27:47,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679665689] [2025-03-16 15:27:47,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:47,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:47,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:47,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:47,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:27:47,199 INFO L87 Difference]: Start difference. First operand 8593 states and 11571 transitions. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:51,468 INFO L93 Difference]: Finished difference Result 19933 states and 28695 transitions. [2025-03-16 15:27:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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 618 [2025-03-16 15:27:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:51,497 INFO L225 Difference]: With dead ends: 19933 [2025-03-16 15:27:51,497 INFO L226 Difference]: Without dead ends: 14071 [2025-03-16 15:27:51,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 617 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-16 15:27:51,506 INFO L435 NwaCegarLoop]: 1306 mSDtfsCounter, 1774 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 3854 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 5582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 3854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:51,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 1444 Invalid, 5582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 3854 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 15:27:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14071 states. [2025-03-16 15:27:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14071 to 14071. [2025-03-16 15:27:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14071 states, 14070 states have (on average 1.2692963752665245) internal successors, (17859), 14070 states have internal predecessors, (17859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14071 states to 14071 states and 17859 transitions. [2025-03-16 15:27:51,666 INFO L78 Accepts]: Start accepts. Automaton has 14071 states and 17859 transitions. Word has length 618 [2025-03-16 15:27:51,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:51,666 INFO L471 AbstractCegarLoop]: Abstraction has 14071 states and 17859 transitions. [2025-03-16 15:27:51,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 14071 states and 17859 transitions. [2025-03-16 15:27:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-03-16 15:27:51,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:51,677 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:27:51,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:27:51,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:27:51,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:51,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:51,881 INFO L85 PathProgramCache]: Analyzing trace with hash -694178061, now seen corresponding path program 1 times [2025-03-16 15:27:51,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:51,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571559333] [2025-03-16 15:27:51,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:51,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:51,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-16 15:27:51,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-16 15:27:51,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:51,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:27:52,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:52,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571559333] [2025-03-16 15:27:52,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571559333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:52,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:52,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:27:52,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136831130] [2025-03-16 15:27:52,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:52,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:52,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:52,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:52,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:52,325 INFO L87 Difference]: Start difference. First operand 14071 states and 17859 transitions. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:27:56,717 INFO L93 Difference]: Finished difference Result 30941 states and 41598 transitions. [2025-03-16 15:27:56,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:27:56,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 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 623 [2025-03-16 15:27:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:27:56,753 INFO L225 Difference]: With dead ends: 30941 [2025-03-16 15:27:56,753 INFO L226 Difference]: Without dead ends: 19601 [2025-03-16 15:27:56,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:56,771 INFO L435 NwaCegarLoop]: 2992 mSDtfsCounter, 1421 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 4130 mSolverCounterSat, 1663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 3161 SdHoareTripleChecker+Invalid, 5793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1663 IncrementalHoareTripleChecker+Valid, 4130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:27:56,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 3161 Invalid, 5793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1663 Valid, 4130 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 15:27:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19601 states. [2025-03-16 15:27:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19601 to 19561. [2025-03-16 15:27:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19561 states, 19560 states have (on average 1.2532208588957054) internal successors, (24513), 19560 states have internal predecessors, (24513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19561 states to 19561 states and 24513 transitions. [2025-03-16 15:27:56,959 INFO L78 Accepts]: Start accepts. Automaton has 19561 states and 24513 transitions. Word has length 623 [2025-03-16 15:27:56,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:27:56,959 INFO L471 AbstractCegarLoop]: Abstraction has 19561 states and 24513 transitions. [2025-03-16 15:27:56,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:27:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 19561 states and 24513 transitions. [2025-03-16 15:27:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-16 15:27:56,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:27:56,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:27:56,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:27:56,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:27:56,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:27:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1741612877, now seen corresponding path program 1 times [2025-03-16 15:27:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:27:56,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167490040] [2025-03-16 15:27:56,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:27:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:27:57,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-16 15:27:57,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-16 15:27:57,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:27:57,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:27:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-16 15:27:57,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:27:57,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167490040] [2025-03-16 15:27:57,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167490040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:27:57,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:27:57,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:27:57,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743253795] [2025-03-16 15:27:57,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:27:57,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:27:57,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:27:57,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:27:57,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:27:57,310 INFO L87 Difference]: Start difference. First operand 19561 states and 24513 transitions. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 2 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:02,054 INFO L93 Difference]: Finished difference Result 51590 states and 66286 transitions. [2025-03-16 15:28:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:02,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 2 states have internal predecessors, (551), 0 states have call successors, (0), 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 626 [2025-03-16 15:28:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:02,100 INFO L225 Difference]: With dead ends: 51590 [2025-03-16 15:28:02,100 INFO L226 Difference]: Without dead ends: 34760 [2025-03-16 15:28:02,113 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-16 15:28:02,114 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 2111 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 5097 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 5531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:02,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 963 Invalid, 5531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5097 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:28:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34760 states. [2025-03-16 15:28:02,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34760 to 33392. [2025-03-16 15:28:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33392 states, 33391 states have (on average 1.248989248599922) internal successors, (41705), 33391 states have internal predecessors, (41705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33392 states to 33392 states and 41705 transitions. [2025-03-16 15:28:02,412 INFO L78 Accepts]: Start accepts. Automaton has 33392 states and 41705 transitions. Word has length 626 [2025-03-16 15:28:02,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:02,413 INFO L471 AbstractCegarLoop]: Abstraction has 33392 states and 41705 transitions. [2025-03-16 15:28:02,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 2 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 33392 states and 41705 transitions. [2025-03-16 15:28:02,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2025-03-16 15:28:02,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:02,419 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:28:02,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:28:02,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:02,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash 773127774, now seen corresponding path program 1 times [2025-03-16 15:28:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:02,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904458503] [2025-03-16 15:28:02,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:02,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:02,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 855 statements into 1 equivalence classes. [2025-03-16 15:28:02,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 855 of 855 statements. [2025-03-16 15:28:02,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:02,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 113 proven. 69 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-16 15:28:03,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:03,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904458503] [2025-03-16 15:28:03,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904458503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:28:03,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185299112] [2025-03-16 15:28:03,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:03,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:28:03,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:28:03,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:28:03,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:28:03,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 855 statements into 1 equivalence classes. [2025-03-16 15:28:03,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 855 of 855 statements. [2025-03-16 15:28:03,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:03,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:03,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:28:03,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:28:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-16 15:28:03,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:28:03,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185299112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:03,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:28:03,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:28:03,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138481986] [2025-03-16 15:28:03,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:03,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:28:03,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:03,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:28:03,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:28:03,354 INFO L87 Difference]: Start difference. First operand 33392 states and 41705 transitions. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:07,848 INFO L93 Difference]: Finished difference Result 83266 states and 106038 transitions. [2025-03-16 15:28:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:07,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 855 [2025-03-16 15:28:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:07,930 INFO L225 Difference]: With dead ends: 83266 [2025-03-16 15:28:07,930 INFO L226 Difference]: Without dead ends: 52605 [2025-03-16 15:28:07,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:28:07,950 INFO L435 NwaCegarLoop]: 1101 mSDtfsCounter, 1575 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4164 mSolverCounterSat, 1906 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 6070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1906 IncrementalHoareTripleChecker+Valid, 4164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:07,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 1227 Invalid, 6070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1906 Valid, 4164 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 15:28:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52605 states. [2025-03-16 15:28:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52605 to 51140. [2025-03-16 15:28:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51140 states, 51139 states have (on average 1.2361211599757524) internal successors, (63214), 51139 states have internal predecessors, (63214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51140 states to 51140 states and 63214 transitions. [2025-03-16 15:28:08,552 INFO L78 Accepts]: Start accepts. Automaton has 51140 states and 63214 transitions. Word has length 855 [2025-03-16 15:28:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:08,553 INFO L471 AbstractCegarLoop]: Abstraction has 51140 states and 63214 transitions. [2025-03-16 15:28:08,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 51140 states and 63214 transitions. [2025-03-16 15:28:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2025-03-16 15:28:08,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:08,559 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:28:08,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:28:08,759 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,SelfDestructingSolverStorable7 [2025-03-16 15:28:08,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:08,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash -864305375, now seen corresponding path program 1 times [2025-03-16 15:28:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56836200] [2025-03-16 15:28:08,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:08,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 879 statements into 1 equivalence classes. [2025-03-16 15:28:08,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 879 of 879 statements. [2025-03-16 15:28:08,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:08,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-16 15:28:09,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56836200] [2025-03-16 15:28:09,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56836200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:09,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:09,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:28:09,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698346802] [2025-03-16 15:28:09,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:09,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:28:09,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:09,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:28:09,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:28:09,110 INFO L87 Difference]: Start difference. First operand 51140 states and 63214 transitions. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:13,447 INFO L93 Difference]: Finished difference Result 115950 states and 144849 transitions. [2025-03-16 15:28:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:13,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 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-16 15:28:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:13,528 INFO L225 Difference]: With dead ends: 115950 [2025-03-16 15:28:13,528 INFO L226 Difference]: Without dead ends: 67541 [2025-03-16 15:28:13,563 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-16 15:28:13,563 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 1354 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 3932 mSolverCounterSat, 2063 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 5995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2063 IncrementalHoareTripleChecker+Valid, 3932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:13,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 798 Invalid, 5995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2063 Valid, 3932 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-16 15:28:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67541 states. [2025-03-16 15:28:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67541 to 67526. [2025-03-16 15:28:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67526 states, 67525 states have (on average 1.2146019992595336) internal successors, (82016), 67525 states have internal predecessors, (82016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67526 states to 67526 states and 82016 transitions. [2025-03-16 15:28:14,120 INFO L78 Accepts]: Start accepts. Automaton has 67526 states and 82016 transitions. Word has length 879 [2025-03-16 15:28:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:14,121 INFO L471 AbstractCegarLoop]: Abstraction has 67526 states and 82016 transitions. [2025-03-16 15:28:14,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:14,121 INFO L276 IsEmpty]: Start isEmpty. Operand 67526 states and 82016 transitions. [2025-03-16 15:28:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2025-03-16 15:28:14,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:14,132 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:28:14,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:28:14,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:14,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1973129614, now seen corresponding path program 1 times [2025-03-16 15:28:14,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:14,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771564477] [2025-03-16 15:28:14,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:14,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:14,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-03-16 15:28:14,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-03-16 15:28:14,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:14,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-16 15:28:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771564477] [2025-03-16 15:28:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771564477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:28:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730108631] [2025-03-16 15:28:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:15,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:28:15,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:15,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:28:15,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:28:15,072 INFO L87 Difference]: Start difference. First operand 67526 states and 82016 transitions. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:19,787 INFO L93 Difference]: Finished difference Result 158349 states and 194645 transitions. [2025-03-16 15:28:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:19,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 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 921 [2025-03-16 15:28:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:19,902 INFO L225 Difference]: With dead ends: 158349 [2025-03-16 15:28:19,902 INFO L226 Difference]: Without dead ends: 93554 [2025-03-16 15:28:19,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:28:19,953 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 1577 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4233 mSolverCounterSat, 2309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 6542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2309 IncrementalHoareTripleChecker+Valid, 4233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:19,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 622 Invalid, 6542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2309 Valid, 4233 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 15:28:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93554 states. [2025-03-16 15:28:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93554 to 88005. [2025-03-16 15:28:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88005 states, 88004 states have (on average 1.2410913140311803) internal successors, (109221), 88004 states have internal predecessors, (109221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88005 states to 88005 states and 109221 transitions. [2025-03-16 15:28:20,901 INFO L78 Accepts]: Start accepts. Automaton has 88005 states and 109221 transitions. Word has length 921 [2025-03-16 15:28:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:20,901 INFO L471 AbstractCegarLoop]: Abstraction has 88005 states and 109221 transitions. [2025-03-16 15:28:20,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 88005 states and 109221 transitions. [2025-03-16 15:28:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2025-03-16 15:28:20,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:20,908 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:28:20,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:28:20,909 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:20,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1720485294, now seen corresponding path program 1 times [2025-03-16 15:28:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:20,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33545439] [2025-03-16 15:28:20,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:20,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:20,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 952 statements into 1 equivalence classes. [2025-03-16 15:28:20,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 952 of 952 statements. [2025-03-16 15:28:20,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:20,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-16 15:28:21,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:21,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33545439] [2025-03-16 15:28:21,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33545439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:21,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:21,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:28:21,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415274193] [2025-03-16 15:28:21,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:21,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:28:21,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:21,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:28:21,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:28:21,306 INFO L87 Difference]: Start difference. First operand 88005 states and 109221 transitions. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:25,604 INFO L93 Difference]: Finished difference Result 176015 states and 218518 transitions. [2025-03-16 15:28:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:28:25,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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 952 [2025-03-16 15:28:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:25,710 INFO L225 Difference]: With dead ends: 176015 [2025-03-16 15:28:25,710 INFO L226 Difference]: Without dead ends: 90741 [2025-03-16 15:28:25,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:28:25,933 INFO L435 NwaCegarLoop]: 2877 mSDtfsCounter, 1503 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 1461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 5132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1461 IncrementalHoareTripleChecker+Valid, 3671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:25,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 3051 Invalid, 5132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1461 Valid, 3671 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-16 15:28:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90741 states. [2025-03-16 15:28:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90741 to 88003. [2025-03-16 15:28:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88003 states, 88002 states have (on average 1.1729506147587554) internal successors, (103222), 88002 states have internal predecessors, (103222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88003 states to 88003 states and 103222 transitions. [2025-03-16 15:28:26,594 INFO L78 Accepts]: Start accepts. Automaton has 88003 states and 103222 transitions. Word has length 952 [2025-03-16 15:28:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:26,595 INFO L471 AbstractCegarLoop]: Abstraction has 88003 states and 103222 transitions. [2025-03-16 15:28:26,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 88003 states and 103222 transitions. [2025-03-16 15:28:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2025-03-16 15:28:26,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:26,602 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:28:26,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:28:26,603 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:26,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:26,603 INFO L85 PathProgramCache]: Analyzing trace with hash -768753548, now seen corresponding path program 1 times [2025-03-16 15:28:26,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:26,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877093899] [2025-03-16 15:28:26,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:26,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:26,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 988 statements into 1 equivalence classes. [2025-03-16 15:28:26,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 988 of 988 statements. [2025-03-16 15:28:26,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:26,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:28:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-03-16 15:28:27,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:28:27,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877093899] [2025-03-16 15:28:27,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877093899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:28:27,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:28:27,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:28:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530559044] [2025-03-16 15:28:27,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:28:27,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:28:27,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:28:27,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:28:27,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:28:27,190 INFO L87 Difference]: Start difference. First operand 88003 states and 103222 transitions. Second operand has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:28:35,342 INFO L93 Difference]: Finished difference Result 303120 states and 361500 transitions. [2025-03-16 15:28:35,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:28:35,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 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 988 [2025-03-16 15:28:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:28:35,619 INFO L225 Difference]: With dead ends: 303120 [2025-03-16 15:28:35,619 INFO L226 Difference]: Without dead ends: 217848 [2025-03-16 15:28:35,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:28:35,678 INFO L435 NwaCegarLoop]: 1199 mSDtfsCounter, 3209 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 9096 mSolverCounterSat, 2561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3209 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 11657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2561 IncrementalHoareTripleChecker+Valid, 9096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:28:35,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3209 Valid, 1514 Invalid, 11657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2561 Valid, 9096 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-03-16 15:28:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217848 states. [2025-03-16 15:28:37,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217848 to 212286. [2025-03-16 15:28:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212286 states, 212285 states have (on average 1.1502979485126128) internal successors, (244191), 212285 states have internal predecessors, (244191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212286 states to 212286 states and 244191 transitions. [2025-03-16 15:28:38,025 INFO L78 Accepts]: Start accepts. Automaton has 212286 states and 244191 transitions. Word has length 988 [2025-03-16 15:28:38,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:28:38,026 INFO L471 AbstractCegarLoop]: Abstraction has 212286 states and 244191 transitions. [2025-03-16 15:28:38,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:28:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 212286 states and 244191 transitions. [2025-03-16 15:28:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1020 [2025-03-16 15:28:38,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:28:38,034 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:28:38,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:28:38,034 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:28:38,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:28:38,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2083238408, now seen corresponding path program 1 times [2025-03-16 15:28:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:28:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491941895] [2025-03-16 15:28:38,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:28:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:28:38,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1019 statements into 1 equivalence classes. [2025-03-16 15:28:38,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1019 of 1019 statements. [2025-03-16 15:28:38,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:28:38,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat