./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label05.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 db95babf73fb1944c5f5cbb1a7fc98d0691e2dd292f8f012fa0cfbffe032486e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:58:56,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:58:56,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:58:56,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:58:56,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:58:56,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:58:56,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:58:56,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:58:56,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:58:56,133 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:58:56,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:58:56,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:58:56,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:58:56,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:58:56,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:58:56,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:58:56,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:58:56,135 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:58:56,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:58:56,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:58:56,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:58:56,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:58:56,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:58:56,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:58:56,136 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:58:56,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:58:56,136 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:58:56,136 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:58:56,136 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:58:56,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:58:56,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:58:56,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:58:56,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:58:56,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:58:56,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:58:56,137 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:58:56,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:58:56,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:58:56,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:58:56,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:58:56,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:58:56,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:58:56,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:58:56,137 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 -> db95babf73fb1944c5f5cbb1a7fc98d0691e2dd292f8f012fa0cfbffe032486e [2025-03-16 14:58:56,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:58:56,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:58:56,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:58:56,352 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:58:56,352 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:58:56,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label05.c [2025-03-16 14:58:57,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef2823ec/6b9db23d07bf40d8bcbe245d596fe63a/FLAG629a1713e [2025-03-16 14:58:57,931 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:58:57,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label05.c [2025-03-16 14:58:57,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef2823ec/6b9db23d07bf40d8bcbe245d596fe63a/FLAG629a1713e [2025-03-16 14:58:58,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef2823ec/6b9db23d07bf40d8bcbe245d596fe63a [2025-03-16 14:58:58,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:58:58,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:58:58,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:58:58,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:58:58,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:58:58,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:58:58" (1/1) ... [2025-03-16 14:58:58,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2959b12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:58, skipping insertion in model container [2025-03-16 14:58:58,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:58:58" (1/1) ... [2025-03-16 14:58:58,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:58:58,318 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/Problem13_label05.c[6050,6063] [2025-03-16 14:58:58,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:58:58,833 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:58:58,850 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/Problem13_label05.c[6050,6063] [2025-03-16 14:58:59,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:58:59,155 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:58:59,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59 WrapperNode [2025-03-16 14:58:59,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:58:59,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:58:59,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:58:59,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:58:59,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:58:59,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:58:59,545 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 14:58:59,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:58:59,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:58:59,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:58:59,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:58:59,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:58:59,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:58:59,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:58:59,833 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:58:59,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:58:59,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:58:59,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:59:00,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:59:00,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:59:00,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:59:00,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:59:00,104 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:59:00,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:59:00,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:59:00,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (1/1) ... [2025-03-16 14:59:00,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:59:00,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:00,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:59:00,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:59:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:59:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:59:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:59:00,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:59:00,196 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:59:00,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:59:04,080 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 14:59:04,081 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:59:04,081 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:59:04,276 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 14:59:04,276 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:59:04,310 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:59:04,311 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:59:04,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:59:04 BoogieIcfgContainer [2025-03-16 14:59:04,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:59:04,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:59:04,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:59:04,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:59:04,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:58:58" (1/3) ... [2025-03-16 14:59:04,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528caf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:59:04, skipping insertion in model container [2025-03-16 14:59:04,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:58:59" (2/3) ... [2025-03-16 14:59:04,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528caf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:59:04, skipping insertion in model container [2025-03-16 14:59:04,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:59:04" (3/3) ... [2025-03-16 14:59:04,320 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label05.c [2025-03-16 14:59:04,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:59:04,332 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label05.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:59:04,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:59:04,412 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;@6d750fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:59:04,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:59:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 14:59:04,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:04,425 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] [2025-03-16 14:59:04,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:04,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:04,429 INFO L85 PathProgramCache]: Analyzing trace with hash 448249358, now seen corresponding path program 1 times [2025-03-16 14:59:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:04,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573438742] [2025-03-16 14:59:04,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:04,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:04,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 14:59:04,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 14:59:04,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:04,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:04,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:04,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573438742] [2025-03-16 14:59:04,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573438742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:04,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:04,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:04,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143879187] [2025-03-16 14:59:04,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:04,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:59:04,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:04,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:59:04,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:59:04,572 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:04,660 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 14:59:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:59:04,662 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-16 14:59:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:04,678 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 14:59:04,678 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 14:59:04,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:59:04,687 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:04,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:59:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 14:59:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 14:59:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 14:59:04,769 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 41 [2025-03-16 14:59:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:04,770 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 14:59:04,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 14:59:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 14:59:04,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:04,771 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] [2025-03-16 14:59:04,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:59:04,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:04,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:04,772 INFO L85 PathProgramCache]: Analyzing trace with hash 274327630, now seen corresponding path program 1 times [2025-03-16 14:59:04,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:04,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97871584] [2025-03-16 14:59:04,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:04,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:04,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 14:59:04,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 14:59:04,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:04,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:04,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:04,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97871584] [2025-03-16 14:59:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97871584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:04,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505029405] [2025-03-16 14:59:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:04,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:04,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:04,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:04,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:04,977 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:08,143 INFO L93 Difference]: Finished difference Result 2905 states and 5325 transitions. [2025-03-16 14:59:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-16 14:59:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:08,150 INFO L225 Difference]: With dead ends: 2905 [2025-03-16 14:59:08,151 INFO L226 Difference]: Without dead ends: 1872 [2025-03-16 14:59:08,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:08,152 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 847 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 3243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:08,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1091 Invalid, 3243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 14:59:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2025-03-16 14:59:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1858. [2025-03-16 14:59:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.5444264943457189) internal successors, (2868), 1857 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2868 transitions. [2025-03-16 14:59:08,208 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2868 transitions. Word has length 41 [2025-03-16 14:59:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:08,208 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2868 transitions. [2025-03-16 14:59:08,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2868 transitions. [2025-03-16 14:59:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 14:59:08,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:08,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:08,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:59:08,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:08,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash 206916385, now seen corresponding path program 1 times [2025-03-16 14:59:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:08,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249541581] [2025-03-16 14:59:08,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:08,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:08,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 14:59:08,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 14:59:08,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:08,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:08,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:08,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249541581] [2025-03-16 14:59:08,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249541581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:08,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:08,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:08,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138028368] [2025-03-16 14:59:08,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:08,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:08,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:08,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:08,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:08,405 INFO L87 Difference]: Start difference. First operand 1858 states and 2868 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:11,082 INFO L93 Difference]: Finished difference Result 5316 states and 8228 transitions. [2025-03-16 14:59:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:11,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-16 14:59:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:11,093 INFO L225 Difference]: With dead ends: 5316 [2025-03-16 14:59:11,093 INFO L226 Difference]: Without dead ends: 3459 [2025-03-16 14:59:11,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:11,097 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:11,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1191 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:59:11,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2025-03-16 14:59:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3458. [2025-03-16 14:59:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 3457 states have (on average 1.380676887474689) internal successors, (4773), 3457 states have internal predecessors, (4773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4773 transitions. [2025-03-16 14:59:11,146 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4773 transitions. Word has length 113 [2025-03-16 14:59:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:11,146 INFO L471 AbstractCegarLoop]: Abstraction has 3458 states and 4773 transitions. [2025-03-16 14:59:11,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4773 transitions. [2025-03-16 14:59:11,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 14:59:11,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:11,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:11,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:59:11,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:11,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash 174211561, now seen corresponding path program 1 times [2025-03-16 14:59:11,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:11,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294675283] [2025-03-16 14:59:11,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:11,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:11,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 14:59:11,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 14:59:11,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:11,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:11,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:11,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294675283] [2025-03-16 14:59:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294675283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:11,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:11,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408602907] [2025-03-16 14:59:11,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:11,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:11,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:11,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:11,319 INFO L87 Difference]: Start difference. First operand 3458 states and 4773 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-16 14:59:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:14,032 INFO L93 Difference]: Finished difference Result 10094 states and 13938 transitions. [2025-03-16 14:59:14,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:14,035 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-16 14:59:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:14,053 INFO L225 Difference]: With dead ends: 10094 [2025-03-16 14:59:14,053 INFO L226 Difference]: Without dead ends: 6637 [2025-03-16 14:59:14,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:14,059 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 932 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:14,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 902 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:59:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2025-03-16 14:59:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6630. [2025-03-16 14:59:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6630 states, 6629 states have (on average 1.2722884296273949) internal successors, (8434), 6629 states have internal predecessors, (8434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6630 states to 6630 states and 8434 transitions. [2025-03-16 14:59:14,152 INFO L78 Accepts]: Start accepts. Automaton has 6630 states and 8434 transitions. Word has length 127 [2025-03-16 14:59:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:14,152 INFO L471 AbstractCegarLoop]: Abstraction has 6630 states and 8434 transitions. [2025-03-16 14:59:14,152 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-16 14:59:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 6630 states and 8434 transitions. [2025-03-16 14:59:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 14:59:14,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:14,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:14,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:59:14,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:14,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:14,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1210308223, now seen corresponding path program 1 times [2025-03-16 14:59:14,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:14,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498691876] [2025-03-16 14:59:14,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:14,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:14,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 14:59:14,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 14:59:14,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:14,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498691876] [2025-03-16 14:59:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498691876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:14,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:14,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:14,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18357117] [2025-03-16 14:59:14,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:14,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:14,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:14,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:14,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:14,393 INFO L87 Difference]: Start difference. First operand 6630 states and 8434 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:16,602 INFO L93 Difference]: Finished difference Result 14046 states and 17669 transitions. [2025-03-16 14:59:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:16,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-16 14:59:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:16,619 INFO L225 Difference]: With dead ends: 14046 [2025-03-16 14:59:16,619 INFO L226 Difference]: Without dead ends: 7417 [2025-03-16 14:59:16,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:16,623 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:16,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1212 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:59:16,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7417 states. [2025-03-16 14:59:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7417 to 7417. [2025-03-16 14:59:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7417 states, 7416 states have (on average 1.244066882416397) internal successors, (9226), 7416 states have internal predecessors, (9226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7417 states to 7417 states and 9226 transitions. [2025-03-16 14:59:16,704 INFO L78 Accepts]: Start accepts. Automaton has 7417 states and 9226 transitions. Word has length 130 [2025-03-16 14:59:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:16,705 INFO L471 AbstractCegarLoop]: Abstraction has 7417 states and 9226 transitions. [2025-03-16 14:59:16,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 7417 states and 9226 transitions. [2025-03-16 14:59:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 14:59:16,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:16,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:16,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:59:16,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:16,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2141887135, now seen corresponding path program 1 times [2025-03-16 14:59:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:16,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913713007] [2025-03-16 14:59:16,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:16,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:16,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 14:59:16,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 14:59:16,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:16,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:16,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:16,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913713007] [2025-03-16 14:59:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913713007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:16,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:16,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:16,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128584071] [2025-03-16 14:59:16,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:16,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:59:16,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:16,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:59:16,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:59:16,876 INFO L87 Difference]: Start difference. First operand 7417 states and 9226 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:22,359 INFO L93 Difference]: Finished difference Result 26863 states and 34003 transitions. [2025-03-16 14:59:22,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:59:22,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 14:59:22,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:22,396 INFO L225 Difference]: With dead ends: 26863 [2025-03-16 14:59:22,396 INFO L226 Difference]: Without dead ends: 20234 [2025-03-16 14:59:22,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:59:22,404 INFO L435 NwaCegarLoop]: 1030 mSDtfsCounter, 1763 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 7331 mSolverCounterSat, 945 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 8276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 945 IncrementalHoareTripleChecker+Valid, 7331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:22,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 1298 Invalid, 8276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [945 Valid, 7331 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-16 14:59:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20234 states. [2025-03-16 14:59:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20234 to 20116. [2025-03-16 14:59:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20116 states, 20115 states have (on average 1.2138702460850113) internal successors, (24417), 20115 states have internal predecessors, (24417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20116 states to 20116 states and 24417 transitions. [2025-03-16 14:59:22,643 INFO L78 Accepts]: Start accepts. Automaton has 20116 states and 24417 transitions. Word has length 137 [2025-03-16 14:59:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:22,644 INFO L471 AbstractCegarLoop]: Abstraction has 20116 states and 24417 transitions. [2025-03-16 14:59:22,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 20116 states and 24417 transitions. [2025-03-16 14:59:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 14:59:22,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:22,647 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:22,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:59:22,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:22,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:22,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1583659342, now seen corresponding path program 1 times [2025-03-16 14:59:22,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:22,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829397169] [2025-03-16 14:59:22,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:22,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:22,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 14:59:22,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 14:59:22,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:22,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-16 14:59:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:22,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829397169] [2025-03-16 14:59:22,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829397169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:22,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:22,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158442059] [2025-03-16 14:59:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:22,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:22,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:22,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:22,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:22,804 INFO L87 Difference]: Start difference. First operand 20116 states and 24417 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:25,376 INFO L93 Difference]: Finished difference Result 48897 states and 60820 transitions. [2025-03-16 14:59:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:25,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 226 [2025-03-16 14:59:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:25,418 INFO L225 Difference]: With dead ends: 48897 [2025-03-16 14:59:25,419 INFO L226 Difference]: Without dead ends: 29569 [2025-03-16 14:59:25,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:25,438 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 950 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 2562 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 3364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 2562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:25,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1705 Invalid, 3364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 2562 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:59:25,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29569 states. [2025-03-16 14:59:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29569 to 29557. [2025-03-16 14:59:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29557 states, 29556 states have (on average 1.220361347949655) internal successors, (36069), 29556 states have internal predecessors, (36069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29557 states to 29557 states and 36069 transitions. [2025-03-16 14:59:25,864 INFO L78 Accepts]: Start accepts. Automaton has 29557 states and 36069 transitions. Word has length 226 [2025-03-16 14:59:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:25,865 INFO L471 AbstractCegarLoop]: Abstraction has 29557 states and 36069 transitions. [2025-03-16 14:59:25,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 29557 states and 36069 transitions. [2025-03-16 14:59:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 14:59:25,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:25,871 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:59:25,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:59:25,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:25,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1458514667, now seen corresponding path program 1 times [2025-03-16 14:59:25,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:25,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861140356] [2025-03-16 14:59:25,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:25,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 14:59:25,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 14:59:25,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:25,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:26,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:26,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861140356] [2025-03-16 14:59:26,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861140356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:26,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:26,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:26,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063482018] [2025-03-16 14:59:26,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:26,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:26,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:26,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:26,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:26,171 INFO L87 Difference]: Start difference. First operand 29557 states and 36069 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:28,772 INFO L93 Difference]: Finished difference Result 58358 states and 71402 transitions. [2025-03-16 14:59:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2025-03-16 14:59:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:28,811 INFO L225 Difference]: With dead ends: 58358 [2025-03-16 14:59:28,812 INFO L226 Difference]: Without dead ends: 29589 [2025-03-16 14:59:28,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:28,837 INFO L435 NwaCegarLoop]: 1780 mSDtfsCounter, 780 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:28,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1919 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:59:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2025-03-16 14:59:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 29556. [2025-03-16 14:59:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29556 states, 29555 states have (on average 1.1418034173574692) internal successors, (33746), 29555 states have internal predecessors, (33746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29556 states to 29556 states and 33746 transitions. [2025-03-16 14:59:29,200 INFO L78 Accepts]: Start accepts. Automaton has 29556 states and 33746 transitions. Word has length 253 [2025-03-16 14:59:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:29,200 INFO L471 AbstractCegarLoop]: Abstraction has 29556 states and 33746 transitions. [2025-03-16 14:59:29,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 29556 states and 33746 transitions. [2025-03-16 14:59:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-16 14:59:29,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:29,205 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:29,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:59:29,205 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:29,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:29,206 INFO L85 PathProgramCache]: Analyzing trace with hash -349200787, now seen corresponding path program 1 times [2025-03-16 14:59:29,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:29,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355870631] [2025-03-16 14:59:29,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:29,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:29,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 14:59:29,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 14:59:29,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:29,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:29,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:29,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355870631] [2025-03-16 14:59:29,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355870631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:29,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:29,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507007496] [2025-03-16 14:59:29,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:29,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:29,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:29,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:29,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:29,324 INFO L87 Difference]: Start difference. First operand 29556 states and 33746 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:32,165 INFO L93 Difference]: Finished difference Result 83496 states and 95474 transitions. [2025-03-16 14:59:32,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:32,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2025-03-16 14:59:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:32,226 INFO L225 Difference]: With dead ends: 83496 [2025-03-16 14:59:32,226 INFO L226 Difference]: Without dead ends: 53940 [2025-03-16 14:59:32,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:32,252 INFO L435 NwaCegarLoop]: 1765 mSDtfsCounter, 879 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 804 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 804 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:32,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1899 Invalid, 3254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [804 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:59:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53940 states. [2025-03-16 14:59:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53940 to 49999. [2025-03-16 14:59:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49999 states, 49998 states have (on average 1.1144645785831433) internal successors, (55721), 49998 states have internal predecessors, (55721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49999 states to 49999 states and 55721 transitions. [2025-03-16 14:59:32,746 INFO L78 Accepts]: Start accepts. Automaton has 49999 states and 55721 transitions. Word has length 262 [2025-03-16 14:59:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:32,746 INFO L471 AbstractCegarLoop]: Abstraction has 49999 states and 55721 transitions. [2025-03-16 14:59:32,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 49999 states and 55721 transitions. [2025-03-16 14:59:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-16 14:59:32,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:32,749 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:59:32,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:59:32,749 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:32,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2023974888, now seen corresponding path program 1 times [2025-03-16 14:59:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:32,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000058869] [2025-03-16 14:59:32,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:32,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:32,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-16 14:59:32,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-16 14:59:32,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:32,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 79 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000058869] [2025-03-16 14:59:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000058869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:59:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242098851] [2025-03-16 14:59:33,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:33,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:59:33,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:33,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:59:33,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:59:33,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-16 14:59:33,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-16 14:59:33,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:33,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:33,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:59:33,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:59:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-16 14:59:33,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:59:33,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242098851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:33,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:59:33,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 14:59:33,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559125864] [2025-03-16 14:59:33,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:33,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:33,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:33,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:33,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:59:33,788 INFO L87 Difference]: Start difference. First operand 49999 states and 55721 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:36,322 INFO L93 Difference]: Finished difference Result 99208 states and 110648 transitions. [2025-03-16 14:59:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:36,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 282 [2025-03-16 14:59:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:36,375 INFO L225 Difference]: With dead ends: 99208 [2025-03-16 14:59:36,375 INFO L226 Difference]: Without dead ends: 49997 [2025-03-16 14:59:36,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:59:36,406 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 1161 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:36,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 1431 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:59:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49997 states. [2025-03-16 14:59:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49997 to 49996. [2025-03-16 14:59:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49996 states, 49995 states have (on average 1.092069206920692) internal successors, (54598), 49995 states have internal predecessors, (54598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49996 states to 49996 states and 54598 transitions. [2025-03-16 14:59:36,779 INFO L78 Accepts]: Start accepts. Automaton has 49996 states and 54598 transitions. Word has length 282 [2025-03-16 14:59:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:36,779 INFO L471 AbstractCegarLoop]: Abstraction has 49996 states and 54598 transitions. [2025-03-16 14:59:36,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 49996 states and 54598 transitions. [2025-03-16 14:59:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-16 14:59:36,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:36,785 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 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-16 14:59:36,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:59:36,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 14:59:36,989 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:36,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1424785773, now seen corresponding path program 1 times [2025-03-16 14:59:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:36,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561410629] [2025-03-16 14:59:36,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:36,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:37,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-16 14:59:37,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-16 14:59:37,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:37,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-16 14:59:37,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561410629] [2025-03-16 14:59:37,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561410629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:37,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:37,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:37,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881252] [2025-03-16 14:59:37,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:37,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:37,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:37,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:37,472 INFO L87 Difference]: Start difference. First operand 49996 states and 54598 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:40,657 INFO L93 Difference]: Finished difference Result 133083 states and 145719 transitions. [2025-03-16 14:59:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:40,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 370 [2025-03-16 14:59:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:40,761 INFO L225 Difference]: With dead ends: 133083 [2025-03-16 14:59:40,761 INFO L226 Difference]: Without dead ends: 83088 [2025-03-16 14:59:40,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:40,801 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 961 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 3398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:40,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 671 Invalid, 3398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 14:59:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83088 states. [2025-03-16 14:59:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83088 to 81506. [2025-03-16 14:59:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81506 states, 81505 states have (on average 1.0858106864609534) internal successors, (88499), 81505 states have internal predecessors, (88499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81506 states to 81506 states and 88499 transitions. [2025-03-16 14:59:41,524 INFO L78 Accepts]: Start accepts. Automaton has 81506 states and 88499 transitions. Word has length 370 [2025-03-16 14:59:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:41,524 INFO L471 AbstractCegarLoop]: Abstraction has 81506 states and 88499 transitions. [2025-03-16 14:59:41,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 81506 states and 88499 transitions. [2025-03-16 14:59:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-16 14:59:41,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:41,531 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:41,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:59:41,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:41,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:41,532 INFO L85 PathProgramCache]: Analyzing trace with hash 494679707, now seen corresponding path program 1 times [2025-03-16 14:59:41,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:41,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296292685] [2025-03-16 14:59:41,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:41,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:41,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-16 14:59:41,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-16 14:59:41,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:41,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 317 proven. 113 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 14:59:42,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:42,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296292685] [2025-03-16 14:59:42,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296292685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:59:42,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407861363] [2025-03-16 14:59:42,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:42,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:59:42,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:42,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:59:42,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:59:42,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-16 14:59:42,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-16 14:59:42,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:42,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:42,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:59:42,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:59:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-03-16 14:59:42,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:59:42,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407861363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:42,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:59:42,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 14:59:42,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592141865] [2025-03-16 14:59:42,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:42,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:42,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:42,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:42,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:59:42,590 INFO L87 Difference]: Start difference. First operand 81506 states and 88499 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:45,727 INFO L93 Difference]: Finished difference Result 185039 states and 202084 transitions. [2025-03-16 14:59:45,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:45,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 432 [2025-03-16 14:59:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:45,847 INFO L225 Difference]: With dead ends: 185039 [2025-03-16 14:59:45,847 INFO L226 Difference]: Without dead ends: 112988 [2025-03-16 14:59:45,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:59:45,894 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 967 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 3455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:45,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 622 Invalid, 3455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 14:59:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112988 states. [2025-03-16 14:59:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112988 to 72031. [2025-03-16 14:59:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72031 states, 72030 states have (on average 1.086366791614605) internal successors, (78251), 72030 states have internal predecessors, (78251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72031 states to 72031 states and 78251 transitions. [2025-03-16 14:59:46,641 INFO L78 Accepts]: Start accepts. Automaton has 72031 states and 78251 transitions. Word has length 432 [2025-03-16 14:59:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:46,642 INFO L471 AbstractCegarLoop]: Abstraction has 72031 states and 78251 transitions. [2025-03-16 14:59:46,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 72031 states and 78251 transitions. [2025-03-16 14:59:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-16 14:59:46,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:46,652 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:46,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:59:46,853 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,SelfDestructingSolverStorable11 [2025-03-16 14:59:46,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:46,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:46,854 INFO L85 PathProgramCache]: Analyzing trace with hash 503450139, now seen corresponding path program 1 times [2025-03-16 14:59:46,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:46,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481066880] [2025-03-16 14:59:46,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:46,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-16 14:59:46,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-16 14:59:46,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:46,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:59:47,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:47,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481066880] [2025-03-16 14:59:47,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481066880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:47,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:47,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:47,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567035886] [2025-03-16 14:59:47,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:47,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:47,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:47,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:47,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:47,386 INFO L87 Difference]: Start difference. First operand 72031 states and 78251 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:49,990 INFO L93 Difference]: Finished difference Result 150341 states and 164239 transitions. [2025-03-16 14:59:49,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:49,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 498 [2025-03-16 14:59:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:50,085 INFO L225 Difference]: With dead ends: 150341 [2025-03-16 14:59:50,085 INFO L226 Difference]: Without dead ends: 79098 [2025-03-16 14:59:50,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:50,131 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 1185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 898 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 898 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:50,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 398 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [898 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:59:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79098 states. [2025-03-16 14:59:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79098 to 79098. [2025-03-16 14:59:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79098 states, 79097 states have (on average 1.0887770711910691) internal successors, (86119), 79097 states have internal predecessors, (86119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79098 states to 79098 states and 86119 transitions. [2025-03-16 14:59:50,923 INFO L78 Accepts]: Start accepts. Automaton has 79098 states and 86119 transitions. Word has length 498 [2025-03-16 14:59:50,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:50,924 INFO L471 AbstractCegarLoop]: Abstraction has 79098 states and 86119 transitions. [2025-03-16 14:59:50,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 79098 states and 86119 transitions. [2025-03-16 14:59:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-16 14:59:50,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:50,934 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:59:50,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:59:50,934 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:50,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:50,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1592621969, now seen corresponding path program 1 times [2025-03-16 14:59:50,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:50,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890220609] [2025-03-16 14:59:50,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:50,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:50,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-16 14:59:50,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-16 14:59:50,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:50,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 463 proven. 110 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-16 14:59:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:51,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890220609] [2025-03-16 14:59:51,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890220609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:59:51,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725046814] [2025-03-16 14:59:51,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:51,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:59:51,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:51,688 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-16 14:59:51,690 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-16 14:59:51,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-16 14:59:51,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-16 14:59:51,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:51,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:51,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:59:51,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:59:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 572 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-16 14:59:52,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:59:52,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725046814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:52,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:59:52,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:59:52,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335593628] [2025-03-16 14:59:52,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:52,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:52,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:52,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:52,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:59:52,011 INFO L87 Difference]: Start difference. First operand 79098 states and 86119 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:54,564 INFO L93 Difference]: Finished difference Result 157398 states and 171436 transitions. [2025-03-16 14:59:54,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:54,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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 514 [2025-03-16 14:59:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:54,639 INFO L225 Difference]: With dead ends: 157398 [2025-03-16 14:59:54,639 INFO L226 Difference]: Without dead ends: 79088 [2025-03-16 14:59:54,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:59:54,685 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 1051 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:54,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 780 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:59:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79088 states. [2025-03-16 14:59:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79088 to 75937. [2025-03-16 14:59:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75937 states, 75936 states have (on average 1.0657132321955332) internal successors, (80926), 75936 states have internal predecessors, (80926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75937 states to 75937 states and 80926 transitions. [2025-03-16 14:59:55,451 INFO L78 Accepts]: Start accepts. Automaton has 75937 states and 80926 transitions. Word has length 514 [2025-03-16 14:59:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:55,451 INFO L471 AbstractCegarLoop]: Abstraction has 75937 states and 80926 transitions. [2025-03-16 14:59:55,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 75937 states and 80926 transitions. [2025-03-16 14:59:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2025-03-16 14:59:55,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:55,466 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:55,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:59:55,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:59:55,667 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:55,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1328536751, now seen corresponding path program 1 times [2025-03-16 14:59:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:55,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37494913] [2025-03-16 14:59:55,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:55,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-03-16 14:59:55,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-03-16 14:59:55,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:55,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 548 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-16 14:59:56,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:56,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37494913] [2025-03-16 14:59:56,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37494913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:56,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:56,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:56,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522874935] [2025-03-16 14:59:56,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:56,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:56,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:56,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:56,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:56,003 INFO L87 Difference]: Start difference. First operand 75937 states and 80926 transitions. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:58,803 INFO L93 Difference]: Finished difference Result 170760 states and 182538 transitions. [2025-03-16 14:59:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:58,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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 617 [2025-03-16 14:59:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:58,904 INFO L225 Difference]: With dead ends: 170760 [2025-03-16 14:59:58,904 INFO L226 Difference]: Without dead ends: 95611 [2025-03-16 14:59:58,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:58,929 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 923 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:58,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 776 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:59:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95611 states. [2025-03-16 14:59:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95611 to 94025. [2025-03-16 14:59:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94025 states, 94024 states have (on average 1.0585382455543266) internal successors, (99528), 94024 states have internal predecessors, (99528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94025 states to 94025 states and 99528 transitions. [2025-03-16 14:59:59,791 INFO L78 Accepts]: Start accepts. Automaton has 94025 states and 99528 transitions. Word has length 617 [2025-03-16 14:59:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:59,791 INFO L471 AbstractCegarLoop]: Abstraction has 94025 states and 99528 transitions. [2025-03-16 14:59:59,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:59:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 94025 states and 99528 transitions. [2025-03-16 14:59:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2025-03-16 14:59:59,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:59,823 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:59,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:59:59,823 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:59,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:59,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1925679616, now seen corresponding path program 1 times [2025-03-16 14:59:59,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:59,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100951992] [2025-03-16 14:59:59,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:59,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:59,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 723 statements into 1 equivalence classes. [2025-03-16 14:59:59,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 723 of 723 statements. [2025-03-16 14:59:59,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:59,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-16 15:00:00,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:00,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100951992] [2025-03-16 15:00:00,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100951992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:00,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:00,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:00,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113142906] [2025-03-16 15:00:00,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:00,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:00,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:00,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:00,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:00,261 INFO L87 Difference]: Start difference. First operand 94025 states and 99528 transitions. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:02,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:02,965 INFO L93 Difference]: Finished difference Result 206156 states and 218932 transitions. [2025-03-16 15:00:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:02,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 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 723 [2025-03-16 15:00:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:03,105 INFO L225 Difference]: With dead ends: 206156 [2025-03-16 15:00:03,105 INFO L226 Difference]: Without dead ends: 112919 [2025-03-16 15:00:03,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:03,163 INFO L435 NwaCegarLoop]: 1763 mSDtfsCounter, 767 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:03,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1895 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:00:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112919 states. [2025-03-16 15:00:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112919 to 111338. [2025-03-16 15:00:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111338 states, 111337 states have (on average 1.0557227157189435) internal successors, (117541), 111337 states have internal predecessors, (117541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111338 states to 111338 states and 117541 transitions. [2025-03-16 15:00:04,195 INFO L78 Accepts]: Start accepts. Automaton has 111338 states and 117541 transitions. Word has length 723 [2025-03-16 15:00:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:04,195 INFO L471 AbstractCegarLoop]: Abstraction has 111338 states and 117541 transitions. [2025-03-16 15:00:04,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 111338 states and 117541 transitions. [2025-03-16 15:00:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2025-03-16 15:00:04,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:04,232 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:04,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:00:04,233 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:04,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash -634584592, now seen corresponding path program 1 times [2025-03-16 15:00:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:04,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151719494] [2025-03-16 15:00:04,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:04,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:04,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 781 statements into 1 equivalence classes. [2025-03-16 15:00:04,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 781 of 781 statements. [2025-03-16 15:00:04,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:04,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1194 backedges. 625 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-03-16 15:00:04,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151719494] [2025-03-16 15:00:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151719494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:04,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:00:04,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672428597] [2025-03-16 15:00:04,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:04,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:00:04,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:04,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:00:04,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:00:04,572 INFO L87 Difference]: Start difference. First operand 111338 states and 117541 transitions. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:10,906 INFO L93 Difference]: Finished difference Result 275519 states and 290987 transitions. [2025-03-16 15:00:10,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:00:10,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 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 781 [2025-03-16 15:00:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:11,077 INFO L225 Difference]: With dead ends: 275519 [2025-03-16 15:00:11,077 INFO L226 Difference]: Without dead ends: 164969 [2025-03-16 15:00:11,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:00:11,144 INFO L435 NwaCegarLoop]: 1465 mSDtfsCounter, 1491 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 7928 mSolverCounterSat, 971 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 8899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 971 IncrementalHoareTripleChecker+Valid, 7928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:11,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1703 Invalid, 8899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [971 Valid, 7928 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-16 15:00:11,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164969 states. [2025-03-16 15:00:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164969 to 160152. [2025-03-16 15:00:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160152 states, 160151 states have (on average 1.0516574982360398) internal successors, (168424), 160151 states have internal predecessors, (168424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160152 states to 160152 states and 168424 transitions. [2025-03-16 15:00:12,849 INFO L78 Accepts]: Start accepts. Automaton has 160152 states and 168424 transitions. Word has length 781 [2025-03-16 15:00:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:12,849 INFO L471 AbstractCegarLoop]: Abstraction has 160152 states and 168424 transitions. [2025-03-16 15:00:12,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 160152 states and 168424 transitions. [2025-03-16 15:00:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2025-03-16 15:00:12,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:12,882 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:12,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:00:12,882 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:12,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1571384253, now seen corresponding path program 1 times [2025-03-16 15:00:12,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:12,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129266408] [2025-03-16 15:00:12,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:12,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:12,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 813 statements into 1 equivalence classes. [2025-03-16 15:00:12,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 813 of 813 statements. [2025-03-16 15:00:12,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:12,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 558 proven. 110 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-16 15:00:14,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129266408] [2025-03-16 15:00:14,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129266408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:00:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671184564] [2025-03-16 15:00:14,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:14,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:00:14,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:00:14,519 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-16 15:00:14,521 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-16 15:00:14,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 813 statements into 1 equivalence classes. [2025-03-16 15:00:14,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 813 of 813 statements. [2025-03-16 15:00:14,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:14,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:14,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:00:14,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:00:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2025-03-16 15:00:14,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:00:14,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671184564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:14,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:00:14,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:00:14,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775192090] [2025-03-16 15:00:14,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:14,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:14,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:14,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:14,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:00:14,807 INFO L87 Difference]: Start difference. First operand 160152 states and 168424 transitions. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:18,137 INFO L93 Difference]: Finished difference Result 350204 states and 368208 transitions. [2025-03-16 15:00:18,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:18,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 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 813 [2025-03-16 15:00:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:18,367 INFO L225 Difference]: With dead ends: 350204 [2025-03-16 15:00:18,367 INFO L226 Difference]: Without dead ends: 188475 [2025-03-16 15:00:18,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 812 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:00:18,473 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 917 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:18,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1672 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:00:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188475 states. [2025-03-16 15:00:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188475 to 172733. [2025-03-16 15:00:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172733 states, 172732 states have (on average 1.0450987657179909) internal successors, (180522), 172732 states have internal predecessors, (180522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172733 states to 172733 states and 180522 transitions. [2025-03-16 15:00:20,352 INFO L78 Accepts]: Start accepts. Automaton has 172733 states and 180522 transitions. Word has length 813 [2025-03-16 15:00:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:20,352 INFO L471 AbstractCegarLoop]: Abstraction has 172733 states and 180522 transitions. [2025-03-16 15:00:20,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 172733 states and 180522 transitions. [2025-03-16 15:00:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2025-03-16 15:00:20,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:20,396 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:20,403 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-16 15:00:20,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 15:00:20,596 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:20,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash 383411684, now seen corresponding path program 1 times [2025-03-16 15:00:20,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:20,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677952397] [2025-03-16 15:00:20,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:20,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms