./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label37.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c9b36c4432c83400aecd1170e3c902f5356c89b28a319ce0e390f2a9fbc6f35 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:05:44,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:05:44,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:05:44,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:05:44,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:05:44,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:05:44,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:05:44,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:05:44,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:05:44,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:05:44,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:05:44,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:05:44,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:05:44,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:05:44,807 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:05:44,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:05:44,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:05:44,808 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:05:44,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:05:44,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:05:44,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:05:44,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:05:44,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:05:44,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:05:44,808 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:05:44,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:05:44,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:05:44,809 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:05:44,809 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:05:44,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:05:44,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:05:44,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:05:44,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:05:44,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:05:44,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:05:44,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:05:44,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:05:44,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:05:44,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:05:44,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:05:44,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:05:44,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:05:44,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:05:44,810 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 -> 0c9b36c4432c83400aecd1170e3c902f5356c89b28a319ce0e390f2a9fbc6f35 [2025-03-08 02:05:45,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:05:45,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:05:45,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:05:45,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:05:45,098 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:05:45,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label37.c [2025-03-08 02:05:46,353 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac0026ab/cf1b0d3791f94984a4789eff7d649f0e/FLAGe9643e0b5 [2025-03-08 02:05:46,676 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:05:46,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label37.c [2025-03-08 02:05:46,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac0026ab/cf1b0d3791f94984a4789eff7d649f0e/FLAGe9643e0b5 [2025-03-08 02:05:46,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac0026ab/cf1b0d3791f94984a4789eff7d649f0e [2025-03-08 02:05:46,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:05:46,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:05:46,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:05:46,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:05:46,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:05:46,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:46" (1/1) ... [2025-03-08 02:05:46,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e45b1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:46, skipping insertion in model container [2025-03-08 02:05:46,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:46" (1/1) ... [2025-03-08 02:05:46,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:05:46,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label37.c[2305,2318] [2025-03-08 02:05:47,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:05:47,128 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:05:47,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label37.c[2305,2318] [2025-03-08 02:05:47,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:05:47,254 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:05:47,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47 WrapperNode [2025-03-08 02:05:47,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:05:47,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:05:47,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:05:47,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:05:47,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,375 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-08 02:05:47,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:05:47,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:05:47,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:05:47,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:05:47,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,447 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:05:47,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:05:47,524 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:05:47,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:05:47,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:05:47,525 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (1/1) ... [2025-03-08 02:05:47,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:05:47,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:47,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:05:47,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:05:47,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:05:47,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:05:47,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:05:47,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:05:47,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:05:47,627 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:05:49,341 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-08 02:05:49,414 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-08 02:05:49,415 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:05:49,433 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:05:49,436 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:05:49,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:49 BoogieIcfgContainer [2025-03-08 02:05:49,436 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:05:49,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:05:49,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:05:49,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:05:49,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:05:46" (1/3) ... [2025-03-08 02:05:49,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6eb35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:49, skipping insertion in model container [2025-03-08 02:05:49,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:47" (2/3) ... [2025-03-08 02:05:49,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6eb35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:49, skipping insertion in model container [2025-03-08 02:05:49,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:49" (3/3) ... [2025-03-08 02:05:49,443 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label37.c [2025-03-08 02:05:49,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:05:49,456 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label37.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:05:49,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:05:49,526 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;@5aac2f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:05:49,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:05:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 02:05:49,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:49,537 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] [2025-03-08 02:05:49,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:49,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1130494295, now seen corresponding path program 1 times [2025-03-08 02:05:49,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:49,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20303042] [2025-03-08 02:05:49,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:49,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 02:05:49,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 02:05:49,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:49,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:05:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20303042] [2025-03-08 02:05:49,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20303042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:49,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:49,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:05:49,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790715410] [2025-03-08 02:05:49,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:49,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:49,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:49,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:49,775 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:51,218 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-03-08 02:05:51,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:51,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-08 02:05:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:51,231 INFO L225 Difference]: With dead ends: 1137 [2025-03-08 02:05:51,231 INFO L226 Difference]: Without dead ends: 662 [2025-03-08 02:05:51,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:51,235 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 364 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:51,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 114 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:05:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-08 02:05:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-08 02:05:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7004538577912254) internal successors, (1124), 661 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1124 transitions. [2025-03-08 02:05:51,280 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1124 transitions. Word has length 20 [2025-03-08 02:05:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:51,280 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1124 transitions. [2025-03-08 02:05:51,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1124 transitions. [2025-03-08 02:05:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 02:05:51,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:51,282 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:51,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:05:51,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:51,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash -586579750, now seen corresponding path program 1 times [2025-03-08 02:05:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733035927] [2025-03-08 02:05:51,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:51,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 02:05:51,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 02:05:51,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:51,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:05:51,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:51,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733035927] [2025-03-08 02:05:51,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733035927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:51,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:51,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:05:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671394884] [2025-03-08 02:05:51,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:51,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:51,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:51,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:51,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:51,494 INFO L87 Difference]: Start difference. First operand 662 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:52,559 INFO L93 Difference]: Finished difference Result 1980 states and 3367 transitions. [2025-03-08 02:05:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:52,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-08 02:05:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:52,566 INFO L225 Difference]: With dead ends: 1980 [2025-03-08 02:05:52,567 INFO L226 Difference]: Without dead ends: 1320 [2025-03-08 02:05:52,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:52,569 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:52,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 218 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:05:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-08 02:05:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-08 02:05:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.4556482183472328) internal successors, (1920), 1319 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1920 transitions. [2025-03-08 02:05:52,608 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1920 transitions. Word has length 86 [2025-03-08 02:05:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:52,608 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1920 transitions. [2025-03-08 02:05:52,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1920 transitions. [2025-03-08 02:05:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 02:05:52,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:52,610 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 02:05:52,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:05:52,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:52,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:52,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1757089511, now seen corresponding path program 1 times [2025-03-08 02:05:52,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:52,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644055966] [2025-03-08 02:05:52,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:52,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:52,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 02:05:52,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 02:05:52,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:52,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:05:52,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:52,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644055966] [2025-03-08 02:05:52,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644055966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:52,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:52,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:52,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633846122] [2025-03-08 02:05:52,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:52,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:05:52,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:52,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:05:52,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:05:52,913 INFO L87 Difference]: Start difference. First operand 1320 states and 1920 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:54,617 INFO L93 Difference]: Finished difference Result 4283 states and 6144 transitions. [2025-03-08 02:05:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:05:54,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-08 02:05:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:54,626 INFO L225 Difference]: With dead ends: 4283 [2025-03-08 02:05:54,627 INFO L226 Difference]: Without dead ends: 2965 [2025-03-08 02:05:54,628 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-08 02:05:54,629 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 886 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:54,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 150 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2071 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:05:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-03-08 02:05:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2965. [2025-03-08 02:05:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.3670715249662617) internal successors, (4052), 2964 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4052 transitions. [2025-03-08 02:05:54,678 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4052 transitions. Word has length 99 [2025-03-08 02:05:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:54,679 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4052 transitions. [2025-03-08 02:05:54,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4052 transitions. [2025-03-08 02:05:54,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 02:05:54,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:54,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:54,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:05:54,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:54,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1938680637, now seen corresponding path program 1 times [2025-03-08 02:05:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:54,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644193003] [2025-03-08 02:05:54,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:54,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:54,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 02:05:54,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 02:05:54,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:54,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 02:05:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644193003] [2025-03-08 02:05:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644193003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:54,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:54,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:05:54,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941169438] [2025-03-08 02:05:54,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:54,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:54,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:54,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:54,935 INFO L87 Difference]: Start difference. First operand 2965 states and 4052 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:56,029 INFO L93 Difference]: Finished difference Result 8231 states and 11469 transitions. [2025-03-08 02:05:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:56,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 186 [2025-03-08 02:05:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:56,049 INFO L225 Difference]: With dead ends: 8231 [2025-03-08 02:05:56,049 INFO L226 Difference]: Without dead ends: 5597 [2025-03-08 02:05:56,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:56,053 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:56,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:05:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-03-08 02:05:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4281. [2025-03-08 02:05:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.3133177570093457) internal successors, (5621), 4280 states have internal predecessors, (5621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5621 transitions. [2025-03-08 02:05:56,136 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5621 transitions. Word has length 186 [2025-03-08 02:05:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:56,137 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5621 transitions. [2025-03-08 02:05:56,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5621 transitions. [2025-03-08 02:05:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-08 02:05:56,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:56,139 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:56,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:05:56,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:56,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:56,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1340421304, now seen corresponding path program 1 times [2025-03-08 02:05:56,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:56,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41384198] [2025-03-08 02:05:56,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:56,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:56,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 02:05:56,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 02:05:56,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:56,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 02:05:56,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:56,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41384198] [2025-03-08 02:05:56,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41384198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:56,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:56,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:05:56,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730428602] [2025-03-08 02:05:56,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:56,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:56,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:56,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:56,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:56,379 INFO L87 Difference]: Start difference. First operand 4281 states and 5621 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:57,255 INFO L93 Difference]: Finished difference Result 9547 states and 12468 transitions. [2025-03-08 02:05:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:57,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 217 [2025-03-08 02:05:57,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:57,269 INFO L225 Difference]: With dead ends: 9547 [2025-03-08 02:05:57,269 INFO L226 Difference]: Without dead ends: 5597 [2025-03-08 02:05:57,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:57,275 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 277 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:57,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 84 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:05:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-03-08 02:05:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-03-08 02:05:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.2162258756254467) internal successors, (6806), 5596 states have internal predecessors, (6806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6806 transitions. [2025-03-08 02:05:57,365 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6806 transitions. Word has length 217 [2025-03-08 02:05:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:57,365 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 6806 transitions. [2025-03-08 02:05:57,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6806 transitions. [2025-03-08 02:05:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-08 02:05:57,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:57,370 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:57,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:05:57,370 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:57,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:57,371 INFO L85 PathProgramCache]: Analyzing trace with hash 527593118, now seen corresponding path program 1 times [2025-03-08 02:05:57,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:57,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129318997] [2025-03-08 02:05:57,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:57,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:57,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-08 02:05:57,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-08 02:05:57,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:57,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:05:57,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:57,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129318997] [2025-03-08 02:05:57,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129318997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:57,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:57,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:05:57,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965542364] [2025-03-08 02:05:57,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:57,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 02:05:57,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:57,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 02:05:57,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:57,969 INFO L87 Difference]: Start difference. First operand 5597 states and 6806 transitions. Second operand has 7 states, 7 states have (on average 50.285714285714285) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:59,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:59,293 INFO L93 Difference]: Finished difference Result 10722 states and 13122 transitions. [2025-03-08 02:05:59,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 02:05:59,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.285714285714285) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2025-03-08 02:05:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:59,304 INFO L225 Difference]: With dead ends: 10722 [2025-03-08 02:05:59,304 INFO L226 Difference]: Without dead ends: 5268 [2025-03-08 02:05:59,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:59,309 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 308 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:59,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 291 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:05:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-03-08 02:05:59,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-03-08 02:05:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0924625023732675) internal successors, (5754), 5267 states have internal predecessors, (5754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5754 transitions. [2025-03-08 02:05:59,366 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5754 transitions. Word has length 352 [2025-03-08 02:05:59,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:59,367 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5754 transitions. [2025-03-08 02:05:59,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.285714285714285) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5754 transitions. [2025-03-08 02:05:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-03-08 02:05:59,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:59,372 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:59,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:05:59,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:59,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1981100155, now seen corresponding path program 1 times [2025-03-08 02:05:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:59,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947879027] [2025-03-08 02:05:59,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:59,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-08 02:05:59,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-08 02:05:59,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:59,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 02:05:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:59,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947879027] [2025-03-08 02:05:59,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947879027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:59,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783021636] [2025-03-08 02:05:59,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:59,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:59,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:59,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:59,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:05:59,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-08 02:05:59,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-08 02:05:59,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:59,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:59,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:05:59,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 02:05:59,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:59,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783021636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:59,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:59,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 02:05:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687917201] [2025-03-08 02:05:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:59,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:59,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:59,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:05:59,926 INFO L87 Difference]: Start difference. First operand 5268 states and 5754 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:00,680 INFO L93 Difference]: Finished difference Result 12837 states and 14168 transitions. [2025-03-08 02:06:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:00,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 359 [2025-03-08 02:06:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:00,705 INFO L225 Difference]: With dead ends: 12837 [2025-03-08 02:06:00,708 INFO L226 Difference]: Without dead ends: 7900 [2025-03-08 02:06:00,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 358 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-08 02:06:00,713 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 329 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:00,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 40 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:06:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-03-08 02:06:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900. [2025-03-08 02:06:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0946955310798836) internal successors, (8647), 7899 states have internal predecessors, (8647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8647 transitions. [2025-03-08 02:06:00,846 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8647 transitions. Word has length 359 [2025-03-08 02:06:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:00,846 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8647 transitions. [2025-03-08 02:06:00,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8647 transitions. [2025-03-08 02:06:00,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 02:06:00,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:00,852 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:00,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:06:01,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:01,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:01,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:01,057 INFO L85 PathProgramCache]: Analyzing trace with hash -982879476, now seen corresponding path program 1 times [2025-03-08 02:06:01,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:01,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657855647] [2025-03-08 02:06:01,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:01,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 02:06:01,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 02:06:01,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:01,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-08 02:06:01,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:01,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657855647] [2025-03-08 02:06:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657855647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:01,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028396603] [2025-03-08 02:06:01,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:01,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:01,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:01,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:01,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:06:01,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 02:06:01,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 02:06:01,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:01,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:01,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:06:01,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 02:06:01,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:06:01,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028396603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:01,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:06:01,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 02:06:01,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373472301] [2025-03-08 02:06:01,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:01,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:01,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:01,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:06:01,713 INFO L87 Difference]: Start difference. First operand 7900 states and 8647 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:02,606 INFO L93 Difference]: Finished difference Result 18101 states and 19954 transitions. [2025-03-08 02:06:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:02,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 476 [2025-03-08 02:06:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:02,630 INFO L225 Difference]: With dead ends: 18101 [2025-03-08 02:06:02,630 INFO L226 Difference]: Without dead ends: 10532 [2025-03-08 02:06:02,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 475 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-08 02:06:02,640 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 330 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:02,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 33 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:06:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10532 states. [2025-03-08 02:06:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10532 to 10203. [2025-03-08 02:06:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10203 states, 10202 states have (on average 1.1027249558910017) internal successors, (11250), 10202 states have internal predecessors, (11250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 11250 transitions. [2025-03-08 02:06:02,794 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 11250 transitions. Word has length 476 [2025-03-08 02:06:02,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:02,795 INFO L471 AbstractCegarLoop]: Abstraction has 10203 states and 11250 transitions. [2025-03-08 02:06:02,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 11250 transitions. [2025-03-08 02:06:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-08 02:06:02,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:02,810 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:02,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 02:06:03,015 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-08 02:06:03,016 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:03,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash 172567727, now seen corresponding path program 1 times [2025-03-08 02:06:03,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:03,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089767628] [2025-03-08 02:06:03,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:03,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:03,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-08 02:06:03,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-08 02:06:03,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:03,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:06:03,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089767628] [2025-03-08 02:06:03,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089767628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:03,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:03,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:03,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083713263] [2025-03-08 02:06:03,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:03,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:06:03,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:03,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:06:03,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:06:03,575 INFO L87 Difference]: Start difference. First operand 10203 states and 11250 transitions. Second operand has 4 states, 4 states have (on average 135.75) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:04,634 INFO L93 Difference]: Finished difference Result 21062 states and 23245 transitions. [2025-03-08 02:06:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:06:04,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 135.75) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 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 543 [2025-03-08 02:06:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:04,651 INFO L225 Difference]: With dead ends: 21062 [2025-03-08 02:06:04,651 INFO L226 Difference]: Without dead ends: 11190 [2025-03-08 02:06:04,660 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-08 02:06:04,660 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 185 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:04,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 67 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:06:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2025-03-08 02:06:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 11190. [2025-03-08 02:06:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11190 states, 11189 states have (on average 1.100455804808294) internal successors, (12313), 11189 states have internal predecessors, (12313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 12313 transitions. [2025-03-08 02:06:04,753 INFO L78 Accepts]: Start accepts. Automaton has 11190 states and 12313 transitions. Word has length 543 [2025-03-08 02:06:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:04,754 INFO L471 AbstractCegarLoop]: Abstraction has 11190 states and 12313 transitions. [2025-03-08 02:06:04,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.75) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 11190 states and 12313 transitions. [2025-03-08 02:06:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-03-08 02:06:04,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:04,780 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:04,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:06:04,780 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:04,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:04,781 INFO L85 PathProgramCache]: Analyzing trace with hash 956661057, now seen corresponding path program 1 times [2025-03-08 02:06:04,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:04,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156834660] [2025-03-08 02:06:04,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:04,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:04,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-08 02:06:04,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-08 02:06:04,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:04,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-08 02:06:05,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:05,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156834660] [2025-03-08 02:06:05,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156834660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:05,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:05,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:05,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706702407] [2025-03-08 02:06:05,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:05,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:05,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:05,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:05,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:05,278 INFO L87 Difference]: Start difference. First operand 11190 states and 12313 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:05,915 INFO L93 Difference]: Finished difference Result 22378 states and 24627 transitions. [2025-03-08 02:06:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:05,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 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 566 [2025-03-08 02:06:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:05,931 INFO L225 Difference]: With dead ends: 22378 [2025-03-08 02:06:05,931 INFO L226 Difference]: Without dead ends: 11519 [2025-03-08 02:06:05,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:05,940 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:05,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 113 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2025-03-08 02:06:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 11519. [2025-03-08 02:06:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 11518 states have (on average 1.0979336690397639) internal successors, (12646), 11518 states have internal predecessors, (12646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12646 transitions. [2025-03-08 02:06:06,030 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 12646 transitions. Word has length 566 [2025-03-08 02:06:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:06,031 INFO L471 AbstractCegarLoop]: Abstraction has 11519 states and 12646 transitions. [2025-03-08 02:06:06,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 12646 transitions. [2025-03-08 02:06:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 02:06:06,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:06,034 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:06,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:06:06,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:06,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:06,035 INFO L85 PathProgramCache]: Analyzing trace with hash 621669333, now seen corresponding path program 1 times [2025-03-08 02:06:06,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:06,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54534460] [2025-03-08 02:06:06,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:06,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:06,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 02:06:06,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 02:06:06,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:06,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 02:06:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:06,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54534460] [2025-03-08 02:06:06,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54534460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:06,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:06,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983446196] [2025-03-08 02:06:06,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:06,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:06,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:06,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:06,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:06,278 INFO L87 Difference]: Start difference. First operand 11519 states and 12646 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:06,806 INFO L93 Difference]: Finished difference Result 22378 states and 24626 transitions. [2025-03-08 02:06:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:06,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 574 [2025-03-08 02:06:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:06,820 INFO L225 Difference]: With dead ends: 22378 [2025-03-08 02:06:06,820 INFO L226 Difference]: Without dead ends: 11519 [2025-03-08 02:06:06,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:06,829 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 278 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:06,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 427 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2025-03-08 02:06:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 11519. [2025-03-08 02:06:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 11518 states have (on average 1.0918562250390693) internal successors, (12576), 11518 states have internal predecessors, (12576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12576 transitions. [2025-03-08 02:06:06,947 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 12576 transitions. Word has length 574 [2025-03-08 02:06:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:06,947 INFO L471 AbstractCegarLoop]: Abstraction has 11519 states and 12576 transitions. [2025-03-08 02:06:06,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 12576 transitions. [2025-03-08 02:06:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-03-08 02:06:06,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:06,953 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:06:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:06:06,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:06,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash 97417377, now seen corresponding path program 1 times [2025-03-08 02:06:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:06,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824690982] [2025-03-08 02:06:06,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:06,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-03-08 02:06:07,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-03-08 02:06:07,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:07,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-03-08 02:06:07,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:07,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824690982] [2025-03-08 02:06:07,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824690982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:07,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778927381] [2025-03-08 02:06:07,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:07,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:07,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:07,414 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:07,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:06:07,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-03-08 02:06:07,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-03-08 02:06:07,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:07,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:07,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:06:07,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-08 02:06:08,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:06:08,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778927381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:08,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:06:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 02:06:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901503068] [2025-03-08 02:06:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:08,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:08,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:08,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:08,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:06:08,157 INFO L87 Difference]: Start difference. First operand 11519 states and 12576 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:08,690 INFO L93 Difference]: Finished difference Result 13495 states and 14612 transitions. [2025-03-08 02:06:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:08,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 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 647 [2025-03-08 02:06:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:08,704 INFO L225 Difference]: With dead ends: 13495 [2025-03-08 02:06:08,704 INFO L226 Difference]: Without dead ends: 13493 [2025-03-08 02:06:08,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 646 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-08 02:06:08,708 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 62 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:08,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 83 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-08 02:06:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 11519. [2025-03-08 02:06:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 11518 states have (on average 1.0918562250390693) internal successors, (12576), 11518 states have internal predecessors, (12576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12576 transitions. [2025-03-08 02:06:08,813 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 12576 transitions. Word has length 647 [2025-03-08 02:06:08,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:08,814 INFO L471 AbstractCegarLoop]: Abstraction has 11519 states and 12576 transitions. [2025-03-08 02:06:08,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 12576 transitions. [2025-03-08 02:06:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2025-03-08 02:06:08,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:08,826 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:08,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 02:06:09,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:09,027 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:09,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1148877082, now seen corresponding path program 1 times [2025-03-08 02:06:09,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:09,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552778616] [2025-03-08 02:06:09,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:09,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:09,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 897 statements into 1 equivalence classes. [2025-03-08 02:06:09,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 897 of 897 statements. [2025-03-08 02:06:09,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:09,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 888 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-03-08 02:06:09,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:09,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552778616] [2025-03-08 02:06:09,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552778616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:09,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:09,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:09,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820844071] [2025-03-08 02:06:09,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:09,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:09,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:09,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:09,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:09,386 INFO L87 Difference]: Start difference. First operand 11519 states and 12576 transitions. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:09,971 INFO L93 Difference]: Finished difference Result 24352 states and 26524 transitions. [2025-03-08 02:06:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:09,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 897 [2025-03-08 02:06:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:09,986 INFO L225 Difference]: With dead ends: 24352 [2025-03-08 02:06:09,986 INFO L226 Difference]: Without dead ends: 11519 [2025-03-08 02:06:09,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:09,998 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 270 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:09,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 430 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11519 states. [2025-03-08 02:06:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11519 to 11190. [2025-03-08 02:06:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11190 states, 11189 states have (on average 1.056305299848065) internal successors, (11819), 11189 states have internal predecessors, (11819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 11819 transitions. [2025-03-08 02:06:10,108 INFO L78 Accepts]: Start accepts. Automaton has 11190 states and 11819 transitions. Word has length 897 [2025-03-08 02:06:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:10,109 INFO L471 AbstractCegarLoop]: Abstraction has 11190 states and 11819 transitions. [2025-03-08 02:06:10,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 11190 states and 11819 transitions. [2025-03-08 02:06:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1205 [2025-03-08 02:06:10,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:10,129 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:10,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:06:10,129 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:10,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash 839039226, now seen corresponding path program 1 times [2025-03-08 02:06:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:10,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098967546] [2025-03-08 02:06:10,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:10,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1204 statements into 1 equivalence classes. [2025-03-08 02:06:10,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1204 of 1204 statements. [2025-03-08 02:06:10,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:10,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2598 backedges. 1731 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2025-03-08 02:06:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:10,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098967546] [2025-03-08 02:06:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098967546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:10,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:10,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:10,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813464862] [2025-03-08 02:06:10,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:10,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:10,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:10,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:10,640 INFO L87 Difference]: Start difference. First operand 11190 states and 11819 transitions. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:11,323 INFO L93 Difference]: Finished difference Result 23036 states and 24373 transitions. [2025-03-08 02:06:11,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:11,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 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 1204 [2025-03-08 02:06:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:11,335 INFO L225 Difference]: With dead ends: 23036 [2025-03-08 02:06:11,335 INFO L226 Difference]: Without dead ends: 12506 [2025-03-08 02:06:11,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:11,343 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 251 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:11,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 424 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-03-08 02:06:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12506. [2025-03-08 02:06:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.048060775689724) internal successors, (13106), 12505 states have internal predecessors, (13106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 13106 transitions. [2025-03-08 02:06:11,476 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 13106 transitions. Word has length 1204 [2025-03-08 02:06:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:11,477 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 13106 transitions. [2025-03-08 02:06:11,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 13106 transitions. [2025-03-08 02:06:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2025-03-08 02:06:11,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:11,503 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:11,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:06:11,503 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:11,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:11,504 INFO L85 PathProgramCache]: Analyzing trace with hash -806553341, now seen corresponding path program 1 times [2025-03-08 02:06:11,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:11,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346540564] [2025-03-08 02:06:11,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:11,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1208 statements into 1 equivalence classes. [2025-03-08 02:06:11,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1208 of 1208 statements. [2025-03-08 02:06:11,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:11,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2733 backedges. 920 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-03-08 02:06:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:12,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346540564] [2025-03-08 02:06:12,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346540564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:12,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:12,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:12,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123221461] [2025-03-08 02:06:12,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:12,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:12,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:12,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:12,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:12,058 INFO L87 Difference]: Start difference. First operand 12506 states and 13106 transitions. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:12,624 INFO L93 Difference]: Finished difference Result 26984 states and 28326 transitions. [2025-03-08 02:06:12,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:12,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 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 1208 [2025-03-08 02:06:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:12,641 INFO L225 Difference]: With dead ends: 26984 [2025-03-08 02:06:12,641 INFO L226 Difference]: Without dead ends: 13493 [2025-03-08 02:06:12,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:12,652 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 172 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:12,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 410 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-08 02:06:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2025-03-08 02:06:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.036466053957901) internal successors, (13984), 13492 states have internal predecessors, (13984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13984 transitions. [2025-03-08 02:06:12,805 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13984 transitions. Word has length 1208 [2025-03-08 02:06:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:12,808 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13984 transitions. [2025-03-08 02:06:12,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13984 transitions. [2025-03-08 02:06:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1341 [2025-03-08 02:06:12,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:12,831 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:12,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:06:12,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:12,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1917205285, now seen corresponding path program 1 times [2025-03-08 02:06:12,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:12,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21559094] [2025-03-08 02:06:12,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:12,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:12,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes. [2025-03-08 02:06:12,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements. [2025-03-08 02:06:12,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:12,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3662 backedges. 2452 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2025-03-08 02:06:13,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:13,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21559094] [2025-03-08 02:06:13,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21559094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:13,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:13,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399247599] [2025-03-08 02:06:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:13,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:13,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:13,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:13,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:13,388 INFO L87 Difference]: Start difference. First operand 13493 states and 13984 transitions. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:13,954 INFO L93 Difference]: Finished difference Result 27313 states and 28328 transitions. [2025-03-08 02:06:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:13,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 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 1340 [2025-03-08 02:06:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:13,969 INFO L225 Difference]: With dead ends: 27313 [2025-03-08 02:06:13,970 INFO L226 Difference]: Without dead ends: 14480 [2025-03-08 02:06:13,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:13,979 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 195 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:13,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 419 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-08 02:06:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14151. [2025-03-08 02:06:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.030600706713781) internal successors, (14583), 14150 states have internal predecessors, (14583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14583 transitions. [2025-03-08 02:06:14,140 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14583 transitions. Word has length 1340 [2025-03-08 02:06:14,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:14,141 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14583 transitions. [2025-03-08 02:06:14,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14583 transitions. [2025-03-08 02:06:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1351 [2025-03-08 02:06:14,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:14,156 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:14,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:06:14,157 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:14,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:14,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1713814331, now seen corresponding path program 1 times [2025-03-08 02:06:14,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:14,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723429757] [2025-03-08 02:06:14,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:14,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:14,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1350 statements into 1 equivalence classes. [2025-03-08 02:06:14,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1350 of 1350 statements. [2025-03-08 02:06:14,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:14,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3085 backedges. 2255 proven. 0 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2025-03-08 02:06:15,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:15,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723429757] [2025-03-08 02:06:15,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723429757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:15,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:15,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:06:15,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691017057] [2025-03-08 02:06:15,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:15,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:06:15,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:15,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:06:15,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:06:15,391 INFO L87 Difference]: Start difference. First operand 14151 states and 14583 transitions. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:16,202 INFO L93 Difference]: Finished difference Result 27652 states and 28510 transitions. [2025-03-08 02:06:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:06:16,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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 1350 [2025-03-08 02:06:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:16,216 INFO L225 Difference]: With dead ends: 27652 [2025-03-08 02:06:16,216 INFO L226 Difference]: Without dead ends: 14161 [2025-03-08 02:06:16,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:06:16,226 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:16,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 438 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:06:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14161 states. [2025-03-08 02:06:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14161 to 13822. [2025-03-08 02:06:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.030677953838362) internal successors, (14245), 13821 states have internal predecessors, (14245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14245 transitions. [2025-03-08 02:06:16,328 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14245 transitions. Word has length 1350 [2025-03-08 02:06:16,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:16,328 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14245 transitions. [2025-03-08 02:06:16,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:16,329 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14245 transitions. [2025-03-08 02:06:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1366 [2025-03-08 02:06:16,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:16,344 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:16,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:06:16,344 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:16,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:16,344 INFO L85 PathProgramCache]: Analyzing trace with hash 161923622, now seen corresponding path program 1 times [2025-03-08 02:06:16,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:16,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404680037] [2025-03-08 02:06:16,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:16,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:16,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1365 statements into 1 equivalence classes. [2025-03-08 02:06:16,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1365 of 1365 statements. [2025-03-08 02:06:16,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:16,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3837 backedges. 2333 proven. 0 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2025-03-08 02:06:17,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:17,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404680037] [2025-03-08 02:06:17,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404680037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:17,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:17,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971243086] [2025-03-08 02:06:17,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:17,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:17,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:17,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:17,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:17,245 INFO L87 Difference]: Start difference. First operand 13822 states and 14245 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:17,843 INFO L93 Difference]: Finished difference Result 27642 states and 28507 transitions. [2025-03-08 02:06:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:17,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1365 [2025-03-08 02:06:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:17,857 INFO L225 Difference]: With dead ends: 27642 [2025-03-08 02:06:17,857 INFO L226 Difference]: Without dead ends: 14480 [2025-03-08 02:06:17,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:17,866 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:17,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 432 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-08 02:06:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2025-03-08 02:06:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.028731265971407) internal successors, (14895), 14479 states have internal predecessors, (14895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 14895 transitions. [2025-03-08 02:06:17,961 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 14895 transitions. Word has length 1365 [2025-03-08 02:06:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:17,962 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 14895 transitions. [2025-03-08 02:06:17,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 14895 transitions. [2025-03-08 02:06:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1391 [2025-03-08 02:06:17,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:17,975 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:17,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:06:17,976 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:17,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1564385203, now seen corresponding path program 1 times [2025-03-08 02:06:17,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184218213] [2025-03-08 02:06:17,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:18,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1390 statements into 1 equivalence classes. [2025-03-08 02:06:18,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1390 of 1390 statements. [2025-03-08 02:06:18,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:18,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3413 backedges. 2413 proven. 0 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2025-03-08 02:06:18,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:18,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184218213] [2025-03-08 02:06:18,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184218213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:18,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:18,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:06:18,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267739121] [2025-03-08 02:06:18,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:18,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:06:18,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:18,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:06:18,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:06:18,866 INFO L87 Difference]: Start difference. First operand 14480 states and 14895 transitions. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:19,547 INFO L93 Difference]: Finished difference Result 28300 states and 29124 transitions. [2025-03-08 02:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:06:19,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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 1390 [2025-03-08 02:06:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:19,559 INFO L225 Difference]: With dead ends: 28300 [2025-03-08 02:06:19,559 INFO L226 Difference]: Without dead ends: 14480 [2025-03-08 02:06:19,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:06:19,566 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:19,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 555 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-08 02:06:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2025-03-08 02:06:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.028040610539402) internal successors, (14885), 14479 states have internal predecessors, (14885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 14885 transitions. [2025-03-08 02:06:19,653 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 14885 transitions. Word has length 1390 [2025-03-08 02:06:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:19,654 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 14885 transitions. [2025-03-08 02:06:19,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 14885 transitions. [2025-03-08 02:06:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1420 [2025-03-08 02:06:19,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:19,667 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:19,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:06:19,668 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:19,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash -447552387, now seen corresponding path program 1 times [2025-03-08 02:06:19,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:19,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245547381] [2025-03-08 02:06:19,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:19,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:19,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1419 statements into 1 equivalence classes. [2025-03-08 02:06:19,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1419 of 1419 statements. [2025-03-08 02:06:19,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:19,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3837 backedges. 1109 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-08 02:06:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245547381] [2025-03-08 02:06:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245547381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:20,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:20,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:20,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935681857] [2025-03-08 02:06:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:20,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:20,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:20,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:20,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:20,409 INFO L87 Difference]: Start difference. First operand 14480 states and 14885 transitions. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:20,980 INFO L93 Difference]: Finished difference Result 28629 states and 29437 transitions. [2025-03-08 02:06:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:20,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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 1419 [2025-03-08 02:06:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:20,996 INFO L225 Difference]: With dead ends: 28629 [2025-03-08 02:06:20,996 INFO L226 Difference]: Without dead ends: 14480 [2025-03-08 02:06:21,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:21,006 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 163 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:21,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 413 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-08 02:06:21,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14151. [2025-03-08 02:06:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0225441696113073) internal successors, (14469), 14150 states have internal predecessors, (14469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14469 transitions. [2025-03-08 02:06:21,109 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14469 transitions. Word has length 1419 [2025-03-08 02:06:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:21,110 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14469 transitions. [2025-03-08 02:06:21,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14469 transitions. [2025-03-08 02:06:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1658 [2025-03-08 02:06:21,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:21,126 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:21,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:06:21,127 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:21,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1687610188, now seen corresponding path program 1 times [2025-03-08 02:06:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:21,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913961632] [2025-03-08 02:06:21,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:21,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:21,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1657 statements into 1 equivalence classes. [2025-03-08 02:06:21,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1657 of 1657 statements. [2025-03-08 02:06:21,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:21,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5203 backedges. 2878 proven. 0 refuted. 0 times theorem prover too weak. 2325 trivial. 0 not checked. [2025-03-08 02:06:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:21,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913961632] [2025-03-08 02:06:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913961632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:21,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:21,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51058576] [2025-03-08 02:06:21,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:21,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:21,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:21,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:21,823 INFO L87 Difference]: Start difference. First operand 14151 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:22,354 INFO L93 Difference]: Finished difference Result 27971 states and 28605 transitions. [2025-03-08 02:06:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:22,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 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 1657 [2025-03-08 02:06:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:22,373 INFO L225 Difference]: With dead ends: 27971 [2025-03-08 02:06:22,373 INFO L226 Difference]: Without dead ends: 14151 [2025-03-08 02:06:22,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:22,383 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 112 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:22,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 377 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:22,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-08 02:06:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 14151. [2025-03-08 02:06:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0214134275618374) internal successors, (14453), 14150 states have internal predecessors, (14453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14453 transitions. [2025-03-08 02:06:22,517 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14453 transitions. Word has length 1657 [2025-03-08 02:06:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:22,519 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14453 transitions. [2025-03-08 02:06:22,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14453 transitions. [2025-03-08 02:06:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1748 [2025-03-08 02:06:22,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:22,541 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:22,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:06:22,541 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:22,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash 303585405, now seen corresponding path program 1 times [2025-03-08 02:06:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:22,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459124130] [2025-03-08 02:06:22,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:22,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:22,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1747 statements into 1 equivalence classes. [2025-03-08 02:06:22,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1747 of 1747 statements. [2025-03-08 02:06:22,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:22,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 4059 proven. 111 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2025-03-08 02:06:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459124130] [2025-03-08 02:06:24,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459124130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280774580] [2025-03-08 02:06:24,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:24,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:24,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:24,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:24,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:06:24,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1747 statements into 1 equivalence classes. [2025-03-08 02:06:24,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1747 of 1747 statements. [2025-03-08 02:06:24,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:24,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:24,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:06:24,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 2334 proven. 201 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2025-03-08 02:06:26,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:06:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 2334 proven. 201 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2025-03-08 02:06:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280774580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:06:30,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:06:30,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 11 [2025-03-08 02:06:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504613364] [2025-03-08 02:06:30,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:06:30,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 02:06:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:30,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 02:06:30,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 02:06:30,402 INFO L87 Difference]: Start difference. First operand 14151 states and 14453 transitions. Second operand has 11 states, 11 states have (on average 202.8181818181818) internal successors, (2231), 11 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:34,083 INFO L93 Difference]: Finished difference Result 28959 states and 29584 transitions. [2025-03-08 02:06:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 02:06:34,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 202.8181818181818) internal successors, (2231), 11 states have internal predecessors, (2231), 0 states have call successors, (0), 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 1747 [2025-03-08 02:06:34,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:34,095 INFO L225 Difference]: With dead ends: 28959 [2025-03-08 02:06:34,096 INFO L226 Difference]: Without dead ends: 15139 [2025-03-08 02:06:34,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3507 GetRequests, 3494 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-08 02:06:34,104 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1098 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 8809 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 8999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 8809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:34,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 104 Invalid, 8999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 8809 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-08 02:06:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15139 states. [2025-03-08 02:06:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15139 to 14809. [2025-03-08 02:06:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.0185710426796326) internal successors, (15083), 14808 states have internal predecessors, (15083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15083 transitions. [2025-03-08 02:06:34,204 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15083 transitions. Word has length 1747 [2025-03-08 02:06:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:34,204 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15083 transitions. [2025-03-08 02:06:34,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 202.8181818181818) internal successors, (2231), 11 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15083 transitions. [2025-03-08 02:06:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2033 [2025-03-08 02:06:34,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:34,228 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:34,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 02:06:34,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:34,428 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:34,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1167713922, now seen corresponding path program 1 times [2025-03-08 02:06:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:34,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522997857] [2025-03-08 02:06:34,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:34,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2032 statements into 1 equivalence classes. [2025-03-08 02:06:34,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2032 of 2032 statements. [2025-03-08 02:06:34,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:34,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7914 backedges. 5739 proven. 726 refuted. 0 times theorem prover too weak. 1449 trivial. 0 not checked. [2025-03-08 02:06:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:38,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522997857] [2025-03-08 02:06:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522997857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:38,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898106298] [2025-03-08 02:06:38,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:38,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:38,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:38,910 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:38,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 02:06:39,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2032 statements into 1 equivalence classes. [2025-03-08 02:06:39,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2032 of 2032 statements. [2025-03-08 02:06:39,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:39,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:39,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 2330 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:06:39,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7914 backedges. 4874 proven. 0 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2025-03-08 02:06:39,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:06:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898106298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:06:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:06:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190954792] [2025-03-08 02:06:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:39,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:39,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:39,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:06:39,771 INFO L87 Difference]: Start difference. First operand 14809 states and 15083 transitions. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:40,390 INFO L93 Difference]: Finished difference Result 29287 states and 29833 transitions. [2025-03-08 02:06:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:40,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 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 2032 [2025-03-08 02:06:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:40,404 INFO L225 Difference]: With dead ends: 29287 [2025-03-08 02:06:40,404 INFO L226 Difference]: Without dead ends: 14809 [2025-03-08 02:06:40,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2040 GetRequests, 2035 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:06:40,408 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:40,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 426 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2025-03-08 02:06:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14809. [2025-03-08 02:06:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.018030794165316) internal successors, (15075), 14808 states have internal predecessors, (15075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15075 transitions. [2025-03-08 02:06:40,525 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15075 transitions. Word has length 2032 [2025-03-08 02:06:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:40,526 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15075 transitions. [2025-03-08 02:06:40,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15075 transitions. [2025-03-08 02:06:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2054 [2025-03-08 02:06:40,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:40,573 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:40,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 02:06:40,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 02:06:40,774 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:40,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash -455147169, now seen corresponding path program 1 times [2025-03-08 02:06:40,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:40,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460868714] [2025-03-08 02:06:40,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:40,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:40,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2053 statements into 1 equivalence classes. [2025-03-08 02:06:40,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2053 of 2053 statements. [2025-03-08 02:06:40,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:40,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7731 backedges. 2509 proven. 3969 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked. [2025-03-08 02:06:44,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:44,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460868714] [2025-03-08 02:06:44,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460868714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:44,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042981025] [2025-03-08 02:06:44,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:44,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:44,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:44,477 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:44,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 02:06:44,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2053 statements into 1 equivalence classes. [2025-03-08 02:06:44,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2053 of 2053 statements. [2025-03-08 02:06:44,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:44,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:44,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 2345 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:06:44,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7731 backedges. 4471 proven. 0 refuted. 0 times theorem prover too weak. 3260 trivial. 0 not checked. [2025-03-08 02:06:45,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:06:45,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042981025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:45,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:06:45,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-08 02:06:45,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324839519] [2025-03-08 02:06:45,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:45,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:45,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:45,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:45,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:06:45,035 INFO L87 Difference]: Start difference. First operand 14809 states and 15075 transitions. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:45,675 INFO L93 Difference]: Finished difference Result 32577 states and 33154 transitions. [2025-03-08 02:06:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:45,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 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 2053 [2025-03-08 02:06:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:45,690 INFO L225 Difference]: With dead ends: 32577 [2025-03-08 02:06:45,690 INFO L226 Difference]: Without dead ends: 17770 [2025-03-08 02:06:45,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2061 GetRequests, 2054 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:06:45,698 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:45,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 424 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2025-03-08 02:06:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17441. [2025-03-08 02:06:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17441 states, 17440 states have (on average 1.0162844036697247) internal successors, (17724), 17440 states have internal predecessors, (17724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 17724 transitions. [2025-03-08 02:06:45,827 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 17724 transitions. Word has length 2053 [2025-03-08 02:06:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:45,828 INFO L471 AbstractCegarLoop]: Abstraction has 17441 states and 17724 transitions. [2025-03-08 02:06:45,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 17724 transitions. [2025-03-08 02:06:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2135 [2025-03-08 02:06:45,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:45,853 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:45,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 02:06:46,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:46,053 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:46,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash 464350265, now seen corresponding path program 1 times [2025-03-08 02:06:46,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:46,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719766298] [2025-03-08 02:06:46,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:46,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:46,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2134 statements into 1 equivalence classes. [2025-03-08 02:06:46,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2134 of 2134 statements. [2025-03-08 02:06:46,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:46,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8486 backedges. 3920 proven. 1608 refuted. 0 times theorem prover too weak. 2958 trivial. 0 not checked. [2025-03-08 02:06:51,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719766298] [2025-03-08 02:06:51,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719766298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585794553] [2025-03-08 02:06:51,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:51,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:51,203 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:51,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 02:06:51,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2134 statements into 1 equivalence classes. [2025-03-08 02:06:51,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2134 of 2134 statements. [2025-03-08 02:06:51,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:51,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:51,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 2431 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:06:51,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8486 backedges. 5386 proven. 250 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-03-08 02:06:52,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:06:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8486 backedges. 4496 proven. 0 refuted. 0 times theorem prover too weak. 3990 trivial. 0 not checked. [2025-03-08 02:06:53,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585794553] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:53,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:06:53,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 4] total 13 [2025-03-08 02:06:53,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904409073] [2025-03-08 02:06:53,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:53,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:53,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:53,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:53,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 02:06:53,600 INFO L87 Difference]: Start difference. First operand 17441 states and 17724 transitions. Second operand has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:54,203 INFO L93 Difference]: Finished difference Result 35867 states and 36466 transitions. [2025-03-08 02:06:54,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:54,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 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 2134 [2025-03-08 02:06:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:54,219 INFO L225 Difference]: With dead ends: 35867 [2025-03-08 02:06:54,219 INFO L226 Difference]: Without dead ends: 18757 [2025-03-08 02:06:54,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4277 GetRequests, 4266 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 02:06:54,229 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 86 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:54,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 18 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18757 states. [2025-03-08 02:06:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18757 to 18757. [2025-03-08 02:06:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18757 states, 18756 states have (on average 1.0164747280870121) internal successors, (19065), 18756 states have internal predecessors, (19065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18757 states to 18757 states and 19065 transitions. [2025-03-08 02:06:54,351 INFO L78 Accepts]: Start accepts. Automaton has 18757 states and 19065 transitions. Word has length 2134 [2025-03-08 02:06:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:54,352 INFO L471 AbstractCegarLoop]: Abstraction has 18757 states and 19065 transitions. [2025-03-08 02:06:54,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 18757 states and 19065 transitions. [2025-03-08 02:06:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2147 [2025-03-08 02:06:54,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:54,377 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:54,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 02:06:54,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:54,578 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:54,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash 8166594, now seen corresponding path program 1 times [2025-03-08 02:06:54,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:54,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555783936] [2025-03-08 02:06:54,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:54,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2146 statements into 1 equivalence classes. [2025-03-08 02:06:54,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2146 of 2146 statements. [2025-03-08 02:06:54,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:54,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8393 backedges. 4077 proven. 585 refuted. 0 times theorem prover too weak. 3731 trivial. 0 not checked. [2025-03-08 02:06:58,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:58,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555783936] [2025-03-08 02:06:58,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555783936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:58,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508591779] [2025-03-08 02:06:58,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:58,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:58,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:58,636 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:58,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 02:06:58,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2146 statements into 1 equivalence classes. [2025-03-08 02:06:58,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2146 of 2146 statements. [2025-03-08 02:06:58,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:58,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:58,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 2438 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:06:59,009 INFO L279 TraceCheckSpWp]: Computing forward predicates...