./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 540d5c4f35934e1abeb0886e7556fb35e244ff515a3f2091d43a3a4e43fb5fb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:53:10,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:53:11,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:53:11,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:53:11,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:53:11,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:53:11,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:53:11,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:53:11,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:53:11,074 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:53:11,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:53:11,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:53:11,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:53:11,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:53:11,075 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:53:11,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:53:11,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:53:11,075 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:53:11,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:53:11,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:53:11,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:53:11,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:53:11,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:53:11,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:53:11,075 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:53:11,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:53:11,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:53:11,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:53:11,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:53:11,077 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 -> 540d5c4f35934e1abeb0886e7556fb35e244ff515a3f2091d43a3a4e43fb5fb5 [2025-03-03 10:53:11,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:53:11,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:53:11,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:53:11,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:53:11,291 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:53:11,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label02.c [2025-03-03 10:53:12,398 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c413bae41/1bfcc5705ac14d588f5f45a60071df3c/FLAG61c964f91 [2025-03-03 10:53:12,698 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:53:12,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label02.c [2025-03-03 10:53:12,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c413bae41/1bfcc5705ac14d588f5f45a60071df3c/FLAG61c964f91 [2025-03-03 10:53:12,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c413bae41/1bfcc5705ac14d588f5f45a60071df3c [2025-03-03 10:53:12,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:53:12,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:53:12,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:53:12,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:53:12,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:53:12,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:53:12" (1/1) ... [2025-03-03 10:53:12,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f92fc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:12, skipping insertion in model container [2025-03-03 10:53:12,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:53:12" (1/1) ... [2025-03-03 10:53:13,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:53:13,136 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_label02.c[6387,6400] [2025-03-03 10:53:13,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:53:13,334 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:53:13,353 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_label02.c[6387,6400] [2025-03-03 10:53:13,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:53:13,462 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:53:13,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13 WrapperNode [2025-03-03 10:53:13,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:53:13,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:53:13,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:53:13,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:53:13,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,595 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-03 10:53:13,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:53:13,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:53:13,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:53:13,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:53:13,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,666 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:53:13,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:53:13,735 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:53:13,735 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:53:13,735 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:53:13,736 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (1/1) ... [2025-03-03 10:53:13,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:53:13,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:13,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:53:13,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:53:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:53:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:53:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:53:13,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:53:13,829 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:53:13,830 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:53:15,356 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-03 10:53:15,430 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-03 10:53:15,430 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:53:15,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:53:15,449 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:53:15,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:15 BoogieIcfgContainer [2025-03-03 10:53:15,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:53:15,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:53:15,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:53:15,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:53:15,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:53:12" (1/3) ... [2025-03-03 10:53:15,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389d8458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:15, skipping insertion in model container [2025-03-03 10:53:15,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:53:13" (2/3) ... [2025-03-03 10:53:15,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389d8458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:53:15, skipping insertion in model container [2025-03-03 10:53:15,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:53:15" (3/3) ... [2025-03-03 10:53:15,462 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label02.c [2025-03-03 10:53:15,473 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:53:15,475 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label02.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:53:15,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:53:15,540 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;@2deb9264, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:53:15,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:53:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 10:53:15,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:15,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:15,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1049035368, now seen corresponding path program 1 times [2025-03-03 10:53:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:15,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689091580] [2025-03-03 10:53:15,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:15,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 10:53:15,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 10:53:15,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:15,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:53:15,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:15,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689091580] [2025-03-03 10:53:15,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689091580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:15,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:15,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:15,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943714951] [2025-03-03 10:53:15,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:15,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:15,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:15,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:15,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:15,889 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 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:17,322 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-03-03 10:53:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:17,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 10:53:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:17,332 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 10:53:17,333 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 10:53:17,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:17,337 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 323 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:17,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 114 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:53:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 10:53:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-03 10:53:17,381 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-03 10:53:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1124 transitions. [2025-03-03 10:53:17,387 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1124 transitions. Word has length 61 [2025-03-03 10:53:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:17,387 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1124 transitions. [2025-03-03 10:53:17,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1124 transitions. [2025-03-03 10:53:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 10:53:17,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:17,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:17,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:53:17,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:17,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1095122378, now seen corresponding path program 1 times [2025-03-03 10:53:17,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:17,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12024733] [2025-03-03 10:53:17,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:17,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 10:53:17,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 10:53:17,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:17,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:53:17,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:17,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12024733] [2025-03-03 10:53:17,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12024733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:17,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:17,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747337199] [2025-03-03 10:53:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:17,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:17,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:17,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:17,607 INFO L87 Difference]: Start difference. First operand 662 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:18,638 INFO L93 Difference]: Finished difference Result 1980 states and 3367 transitions. [2025-03-03 10:53:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:18,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-03 10:53:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:18,642 INFO L225 Difference]: With dead ends: 1980 [2025-03-03 10:53:18,643 INFO L226 Difference]: Without dead ends: 1320 [2025-03-03 10:53:18,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:18,644 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 294 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 217 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-03 10:53:18,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 217 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:53:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-03 10:53:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-03 10:53:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.4564063684609552) internal successors, (1921), 1319 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1921 transitions. [2025-03-03 10:53:18,667 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1921 transitions. Word has length 127 [2025-03-03 10:53:18,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:18,667 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1921 transitions. [2025-03-03 10:53:18,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:18,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1921 transitions. [2025-03-03 10:53:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 10:53:18,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:18,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:18,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:53:18,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:18,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash 343550329, now seen corresponding path program 1 times [2025-03-03 10:53:18,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:18,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343421206] [2025-03-03 10:53:18,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:18,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 10:53:18,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 10:53:18,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:18,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:18,895 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:53:18,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:18,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343421206] [2025-03-03 10:53:18,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343421206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:18,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:18,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:18,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195832575] [2025-03-03 10:53:18,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:18,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:53:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:18,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:53:18,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:18,896 INFO L87 Difference]: Start difference. First operand 1320 states and 1921 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:20,536 INFO L93 Difference]: Finished difference Result 4283 states and 6147 transitions. [2025-03-03 10:53:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:53:20,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-03 10:53:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:20,547 INFO L225 Difference]: With dead ends: 4283 [2025-03-03 10:53:20,547 INFO L226 Difference]: Without dead ends: 2965 [2025-03-03 10:53:20,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:53:20,553 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 885 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:20,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 151 Invalid, 2274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:53:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-03-03 10:53:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2965. [2025-03-03 10:53:20,591 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-03 10:53:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4052 transitions. [2025-03-03 10:53:20,598 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4052 transitions. Word has length 140 [2025-03-03 10:53:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:20,599 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4052 transitions. [2025-03-03 10:53:20,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4052 transitions. [2025-03-03 10:53:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 10:53:20,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:20,604 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:20,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:53:20,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:20,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1930200268, now seen corresponding path program 1 times [2025-03-03 10:53:20,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:20,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147607896] [2025-03-03 10:53:20,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:20,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 10:53:20,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 10:53:20,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:20,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:53:20,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:20,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147607896] [2025-03-03 10:53:20,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147607896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:20,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:20,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462712222] [2025-03-03 10:53:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:20,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:20,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:20,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:20,811 INFO L87 Difference]: Start difference. First operand 2965 states and 4052 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:21,737 INFO L93 Difference]: Finished difference Result 8231 states and 11469 transitions. [2025-03-03 10:53:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:21,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 227 [2025-03-03 10:53:21,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:21,754 INFO L225 Difference]: With dead ends: 8231 [2025-03-03 10:53:21,754 INFO L226 Difference]: Without dead ends: 5597 [2025-03-03 10:53:21,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:21,759 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:21,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:53:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-03-03 10:53:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4939. [2025-03-03 10:53:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.3021466180639936) internal successors, (6430), 4938 states have internal predecessors, (6430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 6430 transitions. [2025-03-03 10:53:21,825 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 6430 transitions. Word has length 227 [2025-03-03 10:53:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:21,826 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 6430 transitions. [2025-03-03 10:53:21,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 6430 transitions. [2025-03-03 10:53:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-03 10:53:21,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:21,829 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:21,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:53:21,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:21,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash -856502758, now seen corresponding path program 1 times [2025-03-03 10:53:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184956252] [2025-03-03 10:53:21,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:21,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:21,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-03 10:53:21,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-03 10:53:21,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:21,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-03 10:53:22,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:22,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184956252] [2025-03-03 10:53:22,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184956252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:22,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:22,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:22,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631081948] [2025-03-03 10:53:22,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:22,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:53:22,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:22,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:53:22,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:22,219 INFO L87 Difference]: Start difference. First operand 4939 states and 6430 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:23,134 INFO L93 Difference]: Finished difference Result 9547 states and 12517 transitions. [2025-03-03 10:53:23,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:53:23,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 319 [2025-03-03 10:53:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:23,145 INFO L225 Difference]: With dead ends: 9547 [2025-03-03 10:53:23,145 INFO L226 Difference]: Without dead ends: 4939 [2025-03-03 10:53:23,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:53:23,149 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 377 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:23,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 322 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:53:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-03-03 10:53:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2025-03-03 10:53:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.300931551235318) internal successors, (6424), 4938 states have internal predecessors, (6424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 6424 transitions. [2025-03-03 10:53:23,213 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 6424 transitions. Word has length 319 [2025-03-03 10:53:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:23,213 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 6424 transitions. [2025-03-03 10:53:23,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 6424 transitions. [2025-03-03 10:53:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-03 10:53:23,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:23,222 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:53:23,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:53:23,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:23,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:23,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1562333311, now seen corresponding path program 1 times [2025-03-03 10:53:23,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:23,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266245130] [2025-03-03 10:53:23,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:23,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-03 10:53:23,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-03 10:53:23,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:23,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-03 10:53:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:23,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266245130] [2025-03-03 10:53:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266245130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137924452] [2025-03-03 10:53:23,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:23,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:23,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:23,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:23,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:23,452 INFO L87 Difference]: Start difference. First operand 4939 states and 6424 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:24,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:24,470 INFO L93 Difference]: Finished difference Result 10205 states and 13271 transitions. [2025-03-03 10:53:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:24,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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 406 [2025-03-03 10:53:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:24,481 INFO L225 Difference]: With dead ends: 10205 [2025-03-03 10:53:24,481 INFO L226 Difference]: Without dead ends: 4939 [2025-03-03 10:53:24,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:24,488 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 233 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:24,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 538 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:53:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-03-03 10:53:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4610. [2025-03-03 10:53:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.080277717509221) internal successors, (4979), 4609 states have internal predecessors, (4979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4979 transitions. [2025-03-03 10:53:24,537 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4979 transitions. Word has length 406 [2025-03-03 10:53:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:24,537 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 4979 transitions. [2025-03-03 10:53:24,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4979 transitions. [2025-03-03 10:53:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-03-03 10:53:24,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:24,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:24,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:53:24,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:24,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:24,543 INFO L85 PathProgramCache]: Analyzing trace with hash 705665972, now seen corresponding path program 1 times [2025-03-03 10:53:24,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:24,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827028872] [2025-03-03 10:53:24,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:24,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:24,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-03 10:53:24,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-03 10:53:24,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:24,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 117 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:53:24,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:24,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827028872] [2025-03-03 10:53:24,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827028872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:24,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108652884] [2025-03-03 10:53:24,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:24,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:24,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:24,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:53:24,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:53:24,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-03 10:53:24,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-03 10:53:24,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:24,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:24,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:53:24,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:53:25,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:53:25,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108652884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:25,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:53:25,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:53:25,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575422841] [2025-03-03 10:53:25,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:25,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:25,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:25,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:25,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:53:25,299 INFO L87 Difference]: Start difference. First operand 4610 states and 4979 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:25,879 INFO L93 Difference]: Finished difference Result 9876 states and 10691 transitions. [2025-03-03 10:53:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:25,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 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 411 [2025-03-03 10:53:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:25,890 INFO L225 Difference]: With dead ends: 9876 [2025-03-03 10:53:25,890 INFO L226 Difference]: Without dead ends: 5597 [2025-03-03 10:53:25,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:53:25,893 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:25,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 33 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:53:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-03-03 10:53:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-03-03 10:53:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.0645103645461043) internal successors, (5957), 5596 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 5957 transitions. [2025-03-03 10:53:25,967 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 5957 transitions. Word has length 411 [2025-03-03 10:53:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:25,967 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 5957 transitions. [2025-03-03 10:53:25,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 5957 transitions. [2025-03-03 10:53:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-03 10:53:25,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:25,972 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:25,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:53:26,177 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-03 10:53:26,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:26,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:26,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2137795332, now seen corresponding path program 1 times [2025-03-03 10:53:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417596584] [2025-03-03 10:53:26,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:26,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:26,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-03 10:53:26,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-03 10:53:26,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:26,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-03 10:53:26,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:26,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417596584] [2025-03-03 10:53:26,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417596584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:26,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924597693] [2025-03-03 10:53:26,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:26,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:26,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:26,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:53:26,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:53:26,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-03 10:53:26,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-03 10:53:26,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:26,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:26,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:53:26,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-03 10:53:27,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:53:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-03 10:53:30,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924597693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:53:30,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:53:30,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-03 10:53:30,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843634939] [2025-03-03 10:53:30,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:53:30,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 10:53:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:30,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 10:53:30,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:53:30,494 INFO L87 Difference]: Start difference. First operand 5597 states and 5957 transitions. Second operand has 8 states, 8 states have (on average 111.5) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:33,394 INFO L93 Difference]: Finished difference Result 18759 states and 20015 transitions. [2025-03-03 10:53:33,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 10:53:33,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 111.5) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 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 475 [2025-03-03 10:53:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:33,416 INFO L225 Difference]: With dead ends: 18759 [2025-03-03 10:53:33,417 INFO L226 Difference]: Without dead ends: 12506 [2025-03-03 10:53:33,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 954 GetRequests, 945 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:53:33,424 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1307 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4115 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 4683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 4115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:33,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 44 Invalid, 4683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 4115 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:53:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-03-03 10:53:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12177. [2025-03-03 10:53:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0596254927726676) internal successors, (12902), 12176 states have internal predecessors, (12902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12902 transitions. [2025-03-03 10:53:33,525 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12902 transitions. Word has length 475 [2025-03-03 10:53:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:33,525 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12902 transitions. [2025-03-03 10:53:33,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.5) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12902 transitions. [2025-03-03 10:53:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2025-03-03 10:53:33,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:33,534 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:33,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:53:33,734 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-03 10:53:33,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:33,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -428250467, now seen corresponding path program 1 times [2025-03-03 10:53:33,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:33,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281520446] [2025-03-03 10:53:33,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:33,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:33,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-03-03 10:53:33,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-03-03 10:53:33,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:33,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-03 10:53:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281520446] [2025-03-03 10:53:34,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281520446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:34,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:34,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:34,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539528965] [2025-03-03 10:53:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:34,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:34,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:34,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:34,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:34,013 INFO L87 Difference]: Start difference. First operand 12177 states and 12902 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-03 10:53:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:34,794 INFO L93 Difference]: Finished difference Result 29287 states and 31147 transitions. [2025-03-03 10:53:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:34,794 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 562 [2025-03-03 10:53:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:34,816 INFO L225 Difference]: With dead ends: 29287 [2025-03-03 10:53:34,817 INFO L226 Difference]: Without dead ends: 17112 [2025-03-03 10:53:34,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:34,831 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 171 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:34,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 449 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:53:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-03-03 10:53:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 14809. [2025-03-03 10:53:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.0497703943814154) internal successors, (15545), 14808 states have internal predecessors, (15545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15545 transitions. [2025-03-03 10:53:35,005 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15545 transitions. Word has length 562 [2025-03-03 10:53:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:35,005 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15545 transitions. [2025-03-03 10:53:35,006 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-03 10:53:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15545 transitions. [2025-03-03 10:53:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-03 10:53:35,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:35,012 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:35,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:53:35,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:35,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:35,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1812608081, now seen corresponding path program 1 times [2025-03-03 10:53:35,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:35,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155671459] [2025-03-03 10:53:35,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:35,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:35,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-03 10:53:35,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-03 10:53:35,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:35,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-03-03 10:53:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155671459] [2025-03-03 10:53:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155671459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:35,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:35,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:35,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124103445] [2025-03-03 10:53:35,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:35,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:35,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:35,420 INFO L87 Difference]: Start difference. First operand 14809 states and 15545 transitions. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:36,163 INFO L93 Difference]: Finished difference Result 33235 states and 34959 transitions. [2025-03-03 10:53:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:36,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 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 698 [2025-03-03 10:53:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:36,196 INFO L225 Difference]: With dead ends: 33235 [2025-03-03 10:53:36,196 INFO L226 Difference]: Without dead ends: 18757 [2025-03-03 10:53:36,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:36,210 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 225 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:36,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 44 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:53:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18757 states. [2025-03-03 10:53:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18757 to 18099. [2025-03-03 10:53:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0503923085423803) internal successors, (19010), 18098 states have internal predecessors, (19010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 19010 transitions. [2025-03-03 10:53:36,367 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 19010 transitions. Word has length 698 [2025-03-03 10:53:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:36,368 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 19010 transitions. [2025-03-03 10:53:36,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 19010 transitions. [2025-03-03 10:53:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2025-03-03 10:53:36,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:36,378 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:36,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:53:36,378 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:36,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1820956660, now seen corresponding path program 1 times [2025-03-03 10:53:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:36,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574596266] [2025-03-03 10:53:36,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:36,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-03-03 10:53:36,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-03-03 10:53:36,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:36,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 514 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-03 10:53:36,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:36,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574596266] [2025-03-03 10:53:36,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574596266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:36,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:36,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209104471] [2025-03-03 10:53:36,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:36,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:36,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:36,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:36,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:36,703 INFO L87 Difference]: Start difference. First operand 18099 states and 19010 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:37,486 INFO L93 Difference]: Finished difference Result 39157 states and 41224 transitions. [2025-03-03 10:53:37,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:37,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 722 [2025-03-03 10:53:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:37,510 INFO L225 Difference]: With dead ends: 39157 [2025-03-03 10:53:37,511 INFO L226 Difference]: Without dead ends: 21060 [2025-03-03 10:53:37,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:37,520 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 225 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:37,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 446 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:53:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-03-03 10:53:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 20731. [2025-03-03 10:53:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20731 states, 20730 states have (on average 1.0455378678244092) internal successors, (21674), 20730 states have internal predecessors, (21674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20731 states to 20731 states and 21674 transitions. [2025-03-03 10:53:37,685 INFO L78 Accepts]: Start accepts. Automaton has 20731 states and 21674 transitions. Word has length 722 [2025-03-03 10:53:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:37,686 INFO L471 AbstractCegarLoop]: Abstraction has 20731 states and 21674 transitions. [2025-03-03 10:53:37,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 20731 states and 21674 transitions. [2025-03-03 10:53:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2025-03-03 10:53:37,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:37,693 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:37,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:53:37,693 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:37,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:37,694 INFO L85 PathProgramCache]: Analyzing trace with hash -616469314, now seen corresponding path program 1 times [2025-03-03 10:53:37,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:37,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206456816] [2025-03-03 10:53:37,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:37,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:37,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-03-03 10:53:37,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-03-03 10:53:37,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:37,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-03-03 10:53:38,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:38,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206456816] [2025-03-03 10:53:38,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206456816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:38,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:38,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:53:38,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706372755] [2025-03-03 10:53:38,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:38,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:53:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:38,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:53:38,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:38,530 INFO L87 Difference]: Start difference. First operand 20731 states and 21674 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:39,327 INFO L93 Difference]: Finished difference Result 21391 states and 22342 transitions. [2025-03-03 10:53:39,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:53:39,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 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 722 [2025-03-03 10:53:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:39,355 INFO L225 Difference]: With dead ends: 21391 [2025-03-03 10:53:39,355 INFO L226 Difference]: Without dead ends: 21060 [2025-03-03 10:53:39,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:39,359 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 504 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:39,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 17 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:53:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-03-03 10:53:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 20731. [2025-03-03 10:53:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20731 states, 20730 states have (on average 1.0453449107573565) internal successors, (21670), 20730 states have internal predecessors, (21670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20731 states to 20731 states and 21670 transitions. [2025-03-03 10:53:39,523 INFO L78 Accepts]: Start accepts. Automaton has 20731 states and 21670 transitions. Word has length 722 [2025-03-03 10:53:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:39,523 INFO L471 AbstractCegarLoop]: Abstraction has 20731 states and 21670 transitions. [2025-03-03 10:53:39,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 20731 states and 21670 transitions. [2025-03-03 10:53:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-03-03 10:53:39,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:39,533 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:39,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:53:39,533 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:39,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:39,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1157384066, now seen corresponding path program 1 times [2025-03-03 10:53:39,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:39,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750976058] [2025-03-03 10:53:39,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:39,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:39,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-03-03 10:53:39,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-03-03 10:53:39,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:39,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 118 proven. 542 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 10:53:40,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750976058] [2025-03-03 10:53:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750976058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151831149] [2025-03-03 10:53:40,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:40,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:40,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:40,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:53:40,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:53:40,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-03-03 10:53:40,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-03-03 10:53:40,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:40,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:40,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:53:40,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-03-03 10:53:40,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:53:40,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151831149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:40,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:53:40,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:53:40,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517663754] [2025-03-03 10:53:40,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:40,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:40,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:40,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:40,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:53:40,432 INFO L87 Difference]: Start difference. First operand 20731 states and 21670 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:41,039 INFO L93 Difference]: Finished difference Result 41131 states and 43007 transitions. [2025-03-03 10:53:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 821 [2025-03-03 10:53:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:41,058 INFO L225 Difference]: With dead ends: 41131 [2025-03-03 10:53:41,059 INFO L226 Difference]: Without dead ends: 20731 [2025-03-03 10:53:41,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 821 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:53:41,065 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 306 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:41,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 381 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:53:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20731 states. [2025-03-03 10:53:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 20402. [2025-03-03 10:53:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20402 states, 20401 states have (on average 1.0399980393117985) internal successors, (21217), 20401 states have internal predecessors, (21217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20402 states to 20402 states and 21217 transitions. [2025-03-03 10:53:41,226 INFO L78 Accepts]: Start accepts. Automaton has 20402 states and 21217 transitions. Word has length 821 [2025-03-03 10:53:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:41,227 INFO L471 AbstractCegarLoop]: Abstraction has 20402 states and 21217 transitions. [2025-03-03 10:53:41,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 20402 states and 21217 transitions. [2025-03-03 10:53:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2025-03-03 10:53:41,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:41,237 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:41,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:53:41,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:41,438 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:41,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1883083558, now seen corresponding path program 1 times [2025-03-03 10:53:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:41,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632195523] [2025-03-03 10:53:41,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:41,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:41,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 869 statements into 1 equivalence classes. [2025-03-03 10:53:41,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 869 of 869 statements. [2025-03-03 10:53:41,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:41,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 941 proven. 100 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-03 10:53:42,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:42,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632195523] [2025-03-03 10:53:42,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632195523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:42,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952394258] [2025-03-03 10:53:42,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:42,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:42,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:53:42,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:53:42,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 869 statements into 1 equivalence classes. [2025-03-03 10:53:42,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 869 of 869 statements. [2025-03-03 10:53:42,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:42,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:42,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 10:53:42,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:44,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 249 proven. 851 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-03 10:53:44,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:53:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 308 proven. 792 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-03 10:53:45,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952394258] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:53:45,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:53:45,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 12 [2025-03-03 10:53:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994657837] [2025-03-03 10:53:45,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:53:45,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 10:53:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:45,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 10:53:45,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 10:53:45,894 INFO L87 Difference]: Start difference. First operand 20402 states and 21217 transitions. Second operand has 13 states, 13 states have (on average 118.0) internal successors, (1534), 12 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:51,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:51,220 INFO L93 Difference]: Finished difference Result 49700 states and 51594 transitions. [2025-03-03 10:53:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 10:53:51,220 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 118.0) internal successors, (1534), 12 states have internal predecessors, (1534), 0 states have call successors, (0), 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 869 [2025-03-03 10:53:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:51,249 INFO L225 Difference]: With dead ends: 49700 [2025-03-03 10:53:51,249 INFO L226 Difference]: Without dead ends: 28971 [2025-03-03 10:53:51,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1752 GetRequests, 1729 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-03-03 10:53:51,267 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4188 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 11078 mSolverCounterSat, 661 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4188 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 11739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 661 IncrementalHoareTripleChecker+Valid, 11078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:51,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4188 Valid, 118 Invalid, 11739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [661 Valid, 11078 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-03 10:53:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28971 states. [2025-03-03 10:53:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28971 to 24679. [2025-03-03 10:53:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24679 states, 24678 states have (on average 1.0362265985898371) internal successors, (25572), 24678 states have internal predecessors, (25572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24679 states to 24679 states and 25572 transitions. [2025-03-03 10:53:51,505 INFO L78 Accepts]: Start accepts. Automaton has 24679 states and 25572 transitions. Word has length 869 [2025-03-03 10:53:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:51,505 INFO L471 AbstractCegarLoop]: Abstraction has 24679 states and 25572 transitions. [2025-03-03 10:53:51,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 118.0) internal successors, (1534), 12 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 24679 states and 25572 transitions. [2025-03-03 10:53:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 972 [2025-03-03 10:53:51,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:51,516 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:53:51,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:53:51,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:51,717 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:51,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:51,718 INFO L85 PathProgramCache]: Analyzing trace with hash 513119733, now seen corresponding path program 1 times [2025-03-03 10:53:51,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:51,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257172865] [2025-03-03 10:53:51,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:51,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:51,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 971 statements into 1 equivalence classes. [2025-03-03 10:53:51,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 971 of 971 statements. [2025-03-03 10:53:51,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:51,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1573 backedges. 1294 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-03-03 10:53:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:52,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257172865] [2025-03-03 10:53:52,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257172865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:52,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:52,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:52,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223906586] [2025-03-03 10:53:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:52,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:52,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:52,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:52,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:52,262 INFO L87 Difference]: Start difference. First operand 24679 states and 25572 transitions. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:52,872 INFO L93 Difference]: Finished difference Result 48698 states and 50468 transitions. [2025-03-03 10:53:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:52,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 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 971 [2025-03-03 10:53:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:52,893 INFO L225 Difference]: With dead ends: 48698 [2025-03-03 10:53:52,893 INFO L226 Difference]: Without dead ends: 24350 [2025-03-03 10:53:52,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:52,909 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 85 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:52,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 433 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:53:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24350 states. [2025-03-03 10:53:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24350 to 23692. [2025-03-03 10:53:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23692 states, 23691 states have (on average 1.0296737157570386) internal successors, (24394), 23691 states have internal predecessors, (24394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23692 states to 23692 states and 24394 transitions. [2025-03-03 10:53:53,097 INFO L78 Accepts]: Start accepts. Automaton has 23692 states and 24394 transitions. Word has length 971 [2025-03-03 10:53:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:53,097 INFO L471 AbstractCegarLoop]: Abstraction has 23692 states and 24394 transitions. [2025-03-03 10:53:53,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 23692 states and 24394 transitions. [2025-03-03 10:53:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2025-03-03 10:53:53,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:53,109 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:53,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:53:53,109 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:53,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:53,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1548290453, now seen corresponding path program 1 times [2025-03-03 10:53:53,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:53,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230427347] [2025-03-03 10:53:53,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:53,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:53,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1009 statements into 1 equivalence classes. [2025-03-03 10:53:53,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1009 of 1009 statements. [2025-03-03 10:53:53,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:53,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1996 backedges. 1188 proven. 115 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-03-03 10:53:53,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:53,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230427347] [2025-03-03 10:53:53,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230427347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:53,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047203384] [2025-03-03 10:53:53,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:53,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:53,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:53,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:53:53,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:53:53,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1009 statements into 1 equivalence classes. [2025-03-03 10:53:53,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1009 of 1009 statements. [2025-03-03 10:53:53,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:53,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:53,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 10:53:53,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1996 backedges. 1188 proven. 115 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-03-03 10:53:55,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:53:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1996 backedges. 1188 proven. 115 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-03-03 10:53:56,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047203384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:53:56,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:53:56,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-03 10:53:56,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473376772] [2025-03-03 10:53:56,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:53:56,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:53:56,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:56,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:53:56,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:53:56,312 INFO L87 Difference]: Start difference. First operand 23692 states and 24394 transitions. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:58,081 INFO L93 Difference]: Finished difference Result 47382 states and 48792 transitions. [2025-03-03 10:53:58,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 10:53:58,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 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 1009 [2025-03-03 10:53:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:58,102 INFO L225 Difference]: With dead ends: 47382 [2025-03-03 10:53:58,102 INFO L226 Difference]: Without dead ends: 24021 [2025-03-03 10:53:58,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2023 GetRequests, 2016 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:53:58,109 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 988 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 3794 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:58,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 129 Invalid, 3860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3794 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:53:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24021 states. [2025-03-03 10:53:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24021 to 22705. [2025-03-03 10:53:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22705 states, 22704 states have (on average 1.025369978858351) internal successors, (23280), 22704 states have internal predecessors, (23280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22705 states to 22705 states and 23280 transitions. [2025-03-03 10:53:58,275 INFO L78 Accepts]: Start accepts. Automaton has 22705 states and 23280 transitions. Word has length 1009 [2025-03-03 10:53:58,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:58,275 INFO L471 AbstractCegarLoop]: Abstraction has 22705 states and 23280 transitions. [2025-03-03 10:53:58,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 22705 states and 23280 transitions. [2025-03-03 10:53:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1343 [2025-03-03 10:53:58,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:58,294 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:58,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 10:53:58,494 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,SelfDestructingSolverStorable15 [2025-03-03 10:53:58,494 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:58,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1307453072, now seen corresponding path program 1 times [2025-03-03 10:53:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:58,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619024769] [2025-03-03 10:53:58,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:58,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1342 statements into 1 equivalence classes. [2025-03-03 10:53:58,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1342 of 1342 statements. [2025-03-03 10:53:58,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:58,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4072 backedges. 1487 proven. 0 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2025-03-03 10:53:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619024769] [2025-03-03 10:53:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619024769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:59,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:59,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:59,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115572577] [2025-03-03 10:53:59,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:59,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:59,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:59,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:59,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:59,008 INFO L87 Difference]: Start difference. First operand 22705 states and 23280 transitions. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:59,723 INFO L93 Difference]: Finished difference Result 47711 states and 48937 transitions. [2025-03-03 10:53:59,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:59,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 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 1342 [2025-03-03 10:53:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:59,740 INFO L225 Difference]: With dead ends: 47711 [2025-03-03 10:53:59,740 INFO L226 Difference]: Without dead ends: 22705 [2025-03-03 10:53:59,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:59,752 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 146 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:59,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 422 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:59,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22705 states. [2025-03-03 10:53:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22705 to 21389. [2025-03-03 10:53:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21389 states, 21388 states have (on average 1.021133345801384) internal successors, (21840), 21388 states have internal predecessors, (21840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21389 states to 21389 states and 21840 transitions. [2025-03-03 10:53:59,904 INFO L78 Accepts]: Start accepts. Automaton has 21389 states and 21840 transitions. Word has length 1342 [2025-03-03 10:53:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:59,904 INFO L471 AbstractCegarLoop]: Abstraction has 21389 states and 21840 transitions. [2025-03-03 10:53:59,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:53:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 21389 states and 21840 transitions. [2025-03-03 10:53:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1359 [2025-03-03 10:53:59,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:59,955 INFO L218 NwaCegarLoop]: trace histogram [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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:59,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:53:59,955 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:59,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash 447668143, now seen corresponding path program 1 times [2025-03-03 10:53:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823456722] [2025-03-03 10:53:59,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:00,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1358 statements into 1 equivalence classes. [2025-03-03 10:54:00,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1358 of 1358 statements. [2025-03-03 10:54:00,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:00,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3363 backedges. 1375 proven. 1583 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-03-03 10:54:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:01,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823456722] [2025-03-03 10:54:01,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823456722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:01,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563192274] [2025-03-03 10:54:01,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:01,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:01,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:01,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:54:01,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:54:01,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1358 statements into 1 equivalence classes. [2025-03-03 10:54:02,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1358 of 1358 statements. [2025-03-03 10:54:02,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:02,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:02,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 1569 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:54:02,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3363 backedges. 1448 proven. 0 refuted. 0 times theorem prover too weak. 1915 trivial. 0 not checked. [2025-03-03 10:54:02,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:54:02,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563192274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:02,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:54:02,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 10:54:02,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504215725] [2025-03-03 10:54:02,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:02,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:02,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:02,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:02,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:54:02,613 INFO L87 Difference]: Start difference. First operand 21389 states and 21840 transitions. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:03,172 INFO L93 Difference]: Finished difference Result 42447 states and 43347 transitions. [2025-03-03 10:54:03,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:03,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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 1358 [2025-03-03 10:54:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:03,190 INFO L225 Difference]: With dead ends: 42447 [2025-03-03 10:54:03,190 INFO L226 Difference]: Without dead ends: 21389 [2025-03-03 10:54:03,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1366 GetRequests, 1358 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:54:03,204 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 72 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:03,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 435 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:03,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21389 states. [2025-03-03 10:54:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21389 to 21389. [2025-03-03 10:54:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21389 states, 21388 states have (on average 1.0189826070693846) internal successors, (21794), 21388 states have internal predecessors, (21794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21389 states to 21389 states and 21794 transitions. [2025-03-03 10:54:03,363 INFO L78 Accepts]: Start accepts. Automaton has 21389 states and 21794 transitions. Word has length 1358 [2025-03-03 10:54:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:03,364 INFO L471 AbstractCegarLoop]: Abstraction has 21389 states and 21794 transitions. [2025-03-03 10:54:03,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 21389 states and 21794 transitions. [2025-03-03 10:54:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1499 [2025-03-03 10:54:03,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:03,381 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:03,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 10:54:03,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 10:54:03,586 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:03,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1861382410, now seen corresponding path program 1 times [2025-03-03 10:54:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:03,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062544368] [2025-03-03 10:54:03,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:03,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:03,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1498 statements into 1 equivalence classes. [2025-03-03 10:54:03,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1498 of 1498 statements. [2025-03-03 10:54:03,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:03,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3992 backedges. 2661 proven. 0 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-03-03 10:54:04,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:04,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062544368] [2025-03-03 10:54:04,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062544368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:04,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:04,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:04,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888564413] [2025-03-03 10:54:04,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:04,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:04,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:04,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:04,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:04,161 INFO L87 Difference]: Start difference. First operand 21389 states and 21794 transitions. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:04,742 INFO L93 Difference]: Finished difference Result 42447 states and 43249 transitions. [2025-03-03 10:54:04,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:04,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 1498 [2025-03-03 10:54:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:04,762 INFO L225 Difference]: With dead ends: 42447 [2025-03-03 10:54:04,762 INFO L226 Difference]: Without dead ends: 21060 [2025-03-03 10:54:04,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:04,775 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:04,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 428 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-03-03 10:54:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 19744. [2025-03-03 10:54:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0149420047611812) internal successors, (20038), 19743 states have internal predecessors, (20038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20038 transitions. [2025-03-03 10:54:04,930 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20038 transitions. Word has length 1498 [2025-03-03 10:54:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:04,930 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20038 transitions. [2025-03-03 10:54:04,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20038 transitions. [2025-03-03 10:54:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1557 [2025-03-03 10:54:04,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:04,949 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 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] [2025-03-03 10:54:04,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:54:04,949 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:04,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash 233591913, now seen corresponding path program 1 times [2025-03-03 10:54:04,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:04,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235637292] [2025-03-03 10:54:04,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:05,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1556 statements into 1 equivalence classes. [2025-03-03 10:54:05,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1556 of 1556 statements. [2025-03-03 10:54:05,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:05,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4281 backedges. 2813 proven. 35 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-03-03 10:54:06,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235637292] [2025-03-03 10:54:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235637292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585684979] [2025-03-03 10:54:06,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:06,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:06,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:06,263 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-03 10:54:06,265 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-03 10:54:06,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1556 statements into 1 equivalence classes. [2025-03-03 10:54:06,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1556 of 1556 statements. [2025-03-03 10:54:06,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:06,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:06,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1797 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 10:54:06,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4281 backedges. 2813 proven. 35 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-03-03 10:54:07,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:54:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4281 backedges. 2526 proven. 322 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-03-03 10:54:10,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585684979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:54:10,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:54:10,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-03 10:54:10,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951867157] [2025-03-03 10:54:10,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:54:10,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:54:10,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:10,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:54:10,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:54:10,474 INFO L87 Difference]: Start difference. First operand 19744 states and 20038 transitions. Second operand has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:12,276 INFO L93 Difference]: Finished difference Result 39486 states and 40079 transitions. [2025-03-03 10:54:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 10:54:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 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 1556 [2025-03-03 10:54:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:12,294 INFO L225 Difference]: With dead ends: 39486 [2025-03-03 10:54:12,294 INFO L226 Difference]: Without dead ends: 20073 [2025-03-03 10:54:12,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3119 GetRequests, 3113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:54:12,306 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 306 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4107 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 4127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:12,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 571 Invalid, 4127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4107 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:54:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2025-03-03 10:54:12,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 20073. [2025-03-03 10:54:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.0145974491829415) internal successors, (20365), 20072 states have internal predecessors, (20365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20365 transitions. [2025-03-03 10:54:12,467 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20365 transitions. Word has length 1556 [2025-03-03 10:54:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:12,467 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20365 transitions. [2025-03-03 10:54:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20365 transitions. [2025-03-03 10:54:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1588 [2025-03-03 10:54:12,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:12,487 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:54:12,494 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-03 10:54:12,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:12,687 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:12,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1742837589, now seen corresponding path program 1 times [2025-03-03 10:54:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:12,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188616698] [2025-03-03 10:54:12,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:12,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:12,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1587 statements into 1 equivalence classes. [2025-03-03 10:54:12,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1587 of 1587 statements. [2025-03-03 10:54:12,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:12,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4312 backedges. 2642 proven. 237 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-03-03 10:54:14,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188616698] [2025-03-03 10:54:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188616698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800650787] [2025-03-03 10:54:14,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:14,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:14,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:14,873 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-03 10:54:14,874 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-03 10:54:14,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1587 statements into 1 equivalence classes. [2025-03-03 10:54:15,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1587 of 1587 statements. [2025-03-03 10:54:15,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:15,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:15,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 1828 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 10:54:15,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4312 backedges. 2677 proven. 464 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2025-03-03 10:54:16,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:54:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4312 backedges. 2677 proven. 464 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2025-03-03 10:54:17,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800650787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:54:17,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:54:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2025-03-03 10:54:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928303920] [2025-03-03 10:54:17,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:54:17,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 10:54:17,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:17,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 10:54:17,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-03 10:54:17,737 INFO L87 Difference]: Start difference. First operand 20073 states and 20365 transitions. Second operand has 13 states, 13 states have (on average 148.53846153846155) internal successors, (1931), 13 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:23,919 INFO L93 Difference]: Finished difference Result 41854 states and 42466 transitions. [2025-03-03 10:54:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 10:54:23,920 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 148.53846153846155) internal successors, (1931), 13 states have internal predecessors, (1931), 0 states have call successors, (0), 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 1587 [2025-03-03 10:54:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:23,942 INFO L225 Difference]: With dead ends: 41854 [2025-03-03 10:54:23,942 INFO L226 Difference]: Without dead ends: 21782 [2025-03-03 10:54:23,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3202 GetRequests, 3176 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2025-03-03 10:54:23,956 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 2427 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 19194 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2427 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 19387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 19194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:23,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2427 Valid, 289 Invalid, 19387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 19194 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-03-03 10:54:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21782 states. [2025-03-03 10:54:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21782 to 20731. [2025-03-03 10:54:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20731 states, 20730 states have (on average 1.013603473227207) internal successors, (21012), 20730 states have internal predecessors, (21012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20731 states to 20731 states and 21012 transitions. [2025-03-03 10:54:24,126 INFO L78 Accepts]: Start accepts. Automaton has 20731 states and 21012 transitions. Word has length 1587 [2025-03-03 10:54:24,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:24,127 INFO L471 AbstractCegarLoop]: Abstraction has 20731 states and 21012 transitions. [2025-03-03 10:54:24,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 148.53846153846155) internal successors, (1931), 13 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20731 states and 21012 transitions. [2025-03-03 10:54:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2299 [2025-03-03 10:54:24,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:24,157 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 9, 9, 9, 9, 8, 8, 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, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:24,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 10:54:24,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-03 10:54:24,357 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:24,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:24,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1571604963, now seen corresponding path program 1 times [2025-03-03 10:54:24,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:24,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597833767] [2025-03-03 10:54:24,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:24,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2298 statements into 1 equivalence classes. [2025-03-03 10:54:24,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2298 of 2298 statements. [2025-03-03 10:54:24,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:24,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10334 backedges. 6203 proven. 0 refuted. 0 times theorem prover too weak. 4131 trivial. 0 not checked. [2025-03-03 10:54:26,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:26,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597833767] [2025-03-03 10:54:26,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597833767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:26,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:26,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:54:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496590004] [2025-03-03 10:54:26,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:26,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:26,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:26,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:26,142 INFO L87 Difference]: Start difference. First operand 20731 states and 21012 transitions. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:26,674 INFO L93 Difference]: Finished difference Result 41460 states and 42025 transitions. [2025-03-03 10:54:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:26,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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 2298 [2025-03-03 10:54:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:26,693 INFO L225 Difference]: With dead ends: 41460 [2025-03-03 10:54:26,693 INFO L226 Difference]: Without dead ends: 21060 [2025-03-03 10:54:26,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:54:26,707 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:26,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 434 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-03-03 10:54:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 20402. [2025-03-03 10:54:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20402 states, 20401 states have (on average 1.0137738346159502) internal successors, (20682), 20401 states have internal predecessors, (20682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20402 states to 20402 states and 20682 transitions. [2025-03-03 10:54:26,912 INFO L78 Accepts]: Start accepts. Automaton has 20402 states and 20682 transitions. Word has length 2298 [2025-03-03 10:54:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:26,913 INFO L471 AbstractCegarLoop]: Abstraction has 20402 states and 20682 transitions. [2025-03-03 10:54:26,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 20402 states and 20682 transitions. [2025-03-03 10:54:26,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2370 [2025-03-03 10:54:26,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:26,942 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:26,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:54:26,942 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:26,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:26,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1645214613, now seen corresponding path program 1 times [2025-03-03 10:54:26,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517109312] [2025-03-03 10:54:26,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:27,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2369 statements into 1 equivalence classes. [2025-03-03 10:54:27,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2369 of 2369 statements. [2025-03-03 10:54:27,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:27,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10949 backedges. 7885 proven. 978 refuted. 0 times theorem prover too weak. 2086 trivial. 0 not checked. [2025-03-03 10:54:30,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:30,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517109312] [2025-03-03 10:54:30,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517109312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:54:30,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272733538] [2025-03-03 10:54:30,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:30,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:30,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:54:30,211 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:54:30,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 10:54:30,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2369 statements into 1 equivalence classes. [2025-03-03 10:54:30,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2369 of 2369 statements. [2025-03-03 10:54:30,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:30,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:30,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 2686 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:54:30,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:54:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10949 backedges. 3942 proven. 0 refuted. 0 times theorem prover too weak. 7007 trivial. 0 not checked. [2025-03-03 10:54:30,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:54:30,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272733538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:30,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:54:30,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-03 10:54:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683703045] [2025-03-03 10:54:30,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:30,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:54:30,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:30,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:54:30,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:54:30,770 INFO L87 Difference]: Start difference. First operand 20402 states and 20682 transitions. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:31,332 INFO L93 Difference]: Finished difference Result 42118 states and 42701 transitions. [2025-03-03 10:54:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:54:31,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 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 2369 [2025-03-03 10:54:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:31,353 INFO L225 Difference]: With dead ends: 42118 [2025-03-03 10:54:31,353 INFO L226 Difference]: Without dead ends: 22047 [2025-03-03 10:54:31,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2375 GetRequests, 2369 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:54:31,364 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 198 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:31,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 422 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:54:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22047 states. [2025-03-03 10:54:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22047 to 20073. [2025-03-03 10:54:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.01404942208051) internal successors, (20354), 20072 states have internal predecessors, (20354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20354 transitions. [2025-03-03 10:54:31,514 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20354 transitions. Word has length 2369 [2025-03-03 10:54:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:31,514 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20354 transitions. [2025-03-03 10:54:31,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20354 transitions. [2025-03-03 10:54:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2417 [2025-03-03 10:54:31,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:31,544 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:54:31,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 10:54:31,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:54:31,745 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:31,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1450282285, now seen corresponding path program 1 times [2025-03-03 10:54:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610228124] [2025-03-03 10:54:31,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:31,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2416 statements into 1 equivalence classes. [2025-03-03 10:54:31,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2416 of 2416 statements. [2025-03-03 10:54:31,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:31,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:54:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11232 backedges. 6955 proven. 0 refuted. 0 times theorem prover too weak. 4277 trivial. 0 not checked. [2025-03-03 10:54:33,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:54:33,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610228124] [2025-03-03 10:54:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610228124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:54:33,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:54:33,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:54:33,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361729222] [2025-03-03 10:54:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:54:33,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:54:33,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:54:33,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:54:33,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:54:33,928 INFO L87 Difference]: Start difference. First operand 20073 states and 20354 transitions. Second operand has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:34,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:54:34,663 INFO L93 Difference]: Finished difference Result 39826 states and 40386 transitions. [2025-03-03 10:54:34,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:54:34,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 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 2416 [2025-03-03 10:54:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:54:34,681 INFO L225 Difference]: With dead ends: 39826 [2025-03-03 10:54:34,681 INFO L226 Difference]: Without dead ends: 20084 [2025-03-03 10:54:34,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:54:34,691 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:54:34,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 438 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:54:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20084 states. [2025-03-03 10:54:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20084 to 19744. [2025-03-03 10:54:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0136250823076534) internal successors, (20012), 19743 states have internal predecessors, (20012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20012 transitions. [2025-03-03 10:54:34,839 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20012 transitions. Word has length 2416 [2025-03-03 10:54:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:54:34,840 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20012 transitions. [2025-03-03 10:54:34,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:54:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20012 transitions. [2025-03-03 10:54:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2487 [2025-03-03 10:54:34,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:54:34,871 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-03 10:54:34,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:54:34,871 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:54:34,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:54:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash 480177066, now seen corresponding path program 1 times [2025-03-03 10:54:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:54:34,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092870089] [2025-03-03 10:54:34,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:54:34,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:54:34,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2486 statements into 1 equivalence classes. [2025-03-03 10:54:35,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2486 of 2486 statements. [2025-03-03 10:54:35,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:54:35,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat