./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label07.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/Problem17_label07.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 4d9630e6a4c9245b15f4f309d83464d257ca20ee86c7917689a5d5471eca79bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:16:16,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:16:16,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:16:16,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:16:16,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:16:16,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:16:16,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:16:16,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:16:16,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:16:16,109 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:16:16,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:16:16,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:16:16,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:16:16,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:16:16,110 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:16:16,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:16:16,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:16:16,111 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:16:16,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:16:16,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:16:16,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:16:16,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:16:16,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:16:16,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:16:16,111 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:16:16,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:16:16,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:16:16,112 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:16:16,112 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:16:16,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:16:16,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:16:16,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:16:16,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:16:16,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:16:16,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:16:16,113 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:16:16,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:16:16,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:16:16,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:16:16,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:16:16,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:16:16,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:16:16,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:16:16,113 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 -> 4d9630e6a4c9245b15f4f309d83464d257ca20ee86c7917689a5d5471eca79bd [2025-03-16 15:16:16,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:16:16,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:16:16,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:16:16,335 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:16:16,335 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:16:16,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label07.c [2025-03-16 15:16:17,496 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c99dbd2/9ad917df08c84f8bb74691e3765f3d15/FLAG6f4ee9236 [2025-03-16 15:16:17,912 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:16:17,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label07.c [2025-03-16 15:16:17,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c99dbd2/9ad917df08c84f8bb74691e3765f3d15/FLAG6f4ee9236 [2025-03-16 15:16:18,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c99dbd2/9ad917df08c84f8bb74691e3765f3d15 [2025-03-16 15:16:18,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:16:18,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:16:18,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:16:18,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:16:18,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:16:18,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:18,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af94278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18, skipping insertion in model container [2025-03-16 15:16:18,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:18,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:16:18,258 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/Problem17_label07.c[4239,4252] [2025-03-16 15:16:18,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:16:18,563 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:16:18,575 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/Problem17_label07.c[4239,4252] [2025-03-16 15:16:18,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:16:18,785 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:16:18,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18 WrapperNode [2025-03-16 15:16:18,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:16:18,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:16:18,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:16:18,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:16:18,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:18,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:19,030 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-16 15:16:19,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:16:19,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:16:19,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:16:19,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:16:19,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:19,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:19,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:19,198 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:16:19,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:19,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:19,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:19,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:19,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:19,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:19,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:16:19,340 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:16:19,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:16:19,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:16:19,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (1/1) ... [2025-03-16 15:16:19,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:16:19,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:16:19,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:16:19,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:16:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:16:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:16:19,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:16:19,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:16:19,436 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:16:19,437 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:16:21,980 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-16 15:16:22,079 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-16 15:16:22,079 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:16:22,102 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:16:22,103 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:16:22,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:16:22 BoogieIcfgContainer [2025-03-16 15:16:22,104 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:16:22,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:16:22,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:16:22,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:16:22,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:16:18" (1/3) ... [2025-03-16 15:16:22,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cf6577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:16:22, skipping insertion in model container [2025-03-16 15:16:22,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:18" (2/3) ... [2025-03-16 15:16:22,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cf6577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:16:22, skipping insertion in model container [2025-03-16 15:16:22,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:16:22" (3/3) ... [2025-03-16 15:16:22,112 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label07.c [2025-03-16 15:16:22,123 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:16:22,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label07.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:16:22,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:16:22,196 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;@2ac3fd84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:16:22,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:16:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states 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:16:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 15:16:22,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:22,206 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] [2025-03-16 15:16:22,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:22,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash -850823833, now seen corresponding path program 1 times [2025-03-16 15:16:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:22,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335839057] [2025-03-16 15:16:22,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:22,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:22,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 15:16:22,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 15:16:22,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:22,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:16:22,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:22,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335839057] [2025-03-16 15:16:22,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335839057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:22,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:22,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:16:22,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195930821] [2025-03-16 15:16:22,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:22,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:16:22,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:22,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:16:22,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:16:22,353 INFO L87 Difference]: Start difference. First operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:16:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:22,400 INFO L93 Difference]: Finished difference Result 1057 states and 1999 transitions. [2025-03-16 15:16:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:16:22,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-16 15:16:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:22,414 INFO L225 Difference]: With dead ends: 1057 [2025-03-16 15:16:22,414 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 15:16:22,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:16:22,422 INFO L435 NwaCegarLoop]: 938 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, 938 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:22,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:16:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 15:16:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-16 15:16:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states 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:16:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2025-03-16 15:16:22,479 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 26 [2025-03-16 15:16:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:22,480 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2025-03-16 15:16:22,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:16:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2025-03-16 15:16:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 15:16:22,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:22,481 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] [2025-03-16 15:16:22,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:16:22,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:22,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1806407973, now seen corresponding path program 1 times [2025-03-16 15:16:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:22,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931522251] [2025-03-16 15:16:22,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:22,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:22,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 15:16:22,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 15:16:22,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:22,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:16:22,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:22,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931522251] [2025-03-16 15:16:22,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931522251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:22,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:22,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:16:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897025735] [2025-03-16 15:16:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:22,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:22,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:22,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:22,647 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:16:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:24,406 INFO L93 Difference]: Finished difference Result 1499 states and 2693 transitions. [2025-03-16 15:16:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:24,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-16 15:16:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:24,410 INFO L225 Difference]: With dead ends: 1499 [2025-03-16 15:16:24,411 INFO L226 Difference]: Without dead ends: 974 [2025-03-16 15:16:24,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:24,413 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 447 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:24,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 497 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:16:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-16 15:16:24,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2025-03-16 15:16:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5082474226804123) internal successors, (1463), 970 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states 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:16:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2025-03-16 15:16:24,440 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 26 [2025-03-16 15:16:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:24,440 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2025-03-16 15:16:24,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:16:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2025-03-16 15:16:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 15:16:24,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:24,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:24,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:16:24,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:24,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1589201347, now seen corresponding path program 1 times [2025-03-16 15:16:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:24,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386337104] [2025-03-16 15:16:24,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:24,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:24,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 15:16:24,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 15:16:24,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:24,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:16:24,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:24,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386337104] [2025-03-16 15:16:24,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386337104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:24,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:24,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:24,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374478673] [2025-03-16 15:16:24,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:24,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:24,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:24,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:24,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:24,717 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:16:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:26,441 INFO L93 Difference]: Finished difference Result 2813 states and 4241 transitions. [2025-03-16 15:16:26,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:26,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 15:16:26,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:26,450 INFO L225 Difference]: With dead ends: 2813 [2025-03-16 15:16:26,451 INFO L226 Difference]: Without dead ends: 1843 [2025-03-16 15:16:26,455 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:16:26,456 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 464 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:26,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 919 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:16:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-16 15:16:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841. [2025-03-16 15:16:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3603260869565217) internal successors, (2503), 1840 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states 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:16:26,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2503 transitions. [2025-03-16 15:16:26,502 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2503 transitions. Word has length 96 [2025-03-16 15:16:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:26,503 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2503 transitions. [2025-03-16 15:16:26,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:16:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2503 transitions. [2025-03-16 15:16:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 15:16:26,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:26,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:26,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:16:26,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:26,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1703028456, now seen corresponding path program 1 times [2025-03-16 15:16:26,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:26,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977544150] [2025-03-16 15:16:26,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:26,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:26,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 15:16:26,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 15:16:26,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:26,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:16:26,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:26,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977544150] [2025-03-16 15:16:26,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977544150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:26,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:26,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:16:26,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326420917] [2025-03-16 15:16:26,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:26,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:26,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:26,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:26,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:26,738 INFO L87 Difference]: Start difference. First operand 1841 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:16:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:28,294 INFO L93 Difference]: Finished difference Result 5394 states and 7325 transitions. [2025-03-16 15:16:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:28,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-16 15:16:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:28,303 INFO L225 Difference]: With dead ends: 5394 [2025-03-16 15:16:28,303 INFO L226 Difference]: Without dead ends: 2700 [2025-03-16 15:16:28,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:28,307 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:28,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:16:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2025-03-16 15:16:28,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2025-03-16 15:16:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 1.1919229344201556) internal successors, (3217), 2699 states have internal predecessors, (3217), 0 states have call successors, (0), 0 states 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:16:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3217 transitions. [2025-03-16 15:16:28,351 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3217 transitions. Word has length 118 [2025-03-16 15:16:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:28,352 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 3217 transitions. [2025-03-16 15:16:28,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:16:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3217 transitions. [2025-03-16 15:16:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 15:16:28,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:28,354 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:16:28,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:16:28,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:28,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash 822728480, now seen corresponding path program 1 times [2025-03-16 15:16:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:28,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075741584] [2025-03-16 15:16:28,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:28,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 15:16:28,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 15:16:28,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:28,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:16:28,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075741584] [2025-03-16 15:16:28,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075741584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:28,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:28,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:28,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369177806] [2025-03-16 15:16:28,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:28,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:28,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:28,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:28,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:28,603 INFO L87 Difference]: Start difference. First operand 2700 states and 3217 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:16:29,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:29,790 INFO L93 Difference]: Finished difference Result 7107 states and 8597 transitions. [2025-03-16 15:16:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-16 15:16:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:29,801 INFO L225 Difference]: With dead ends: 7107 [2025-03-16 15:16:29,801 INFO L226 Difference]: Without dead ends: 4408 [2025-03-16 15:16:29,804 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:16:29,805 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:29,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:16:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2025-03-16 15:16:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4408. [2025-03-16 15:16:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 4407 states have (on average 1.1706376219650556) internal successors, (5159), 4407 states have internal predecessors, (5159), 0 states have call successors, (0), 0 states 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:16:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5159 transitions. [2025-03-16 15:16:29,858 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5159 transitions. Word has length 178 [2025-03-16 15:16:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:29,859 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5159 transitions. [2025-03-16 15:16:29,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:16:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5159 transitions. [2025-03-16 15:16:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 15:16:29,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:29,860 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:16:29,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:16:29,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:29,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash 976333029, now seen corresponding path program 1 times [2025-03-16 15:16:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:29,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540364517] [2025-03-16 15:16:29,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:29,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:29,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 15:16:29,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 15:16:29,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:29,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:16:29,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:29,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540364517] [2025-03-16 15:16:29,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540364517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:29,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:29,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:29,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069907849] [2025-03-16 15:16:29,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:29,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:29,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:29,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:29,990 INFO L87 Difference]: Start difference. First operand 4408 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:16:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:31,220 INFO L93 Difference]: Finished difference Result 10935 states and 12969 transitions. [2025-03-16 15:16:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:31,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 180 [2025-03-16 15:16:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:31,234 INFO L225 Difference]: With dead ends: 10935 [2025-03-16 15:16:31,234 INFO L226 Difference]: Without dead ends: 6527 [2025-03-16 15:16:31,238 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:16:31,239 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 423 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:31,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:16:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2025-03-16 15:16:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 4381. [2025-03-16 15:16:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4380 states have (on average 1.1684931506849314) internal successors, (5118), 4380 states have internal predecessors, (5118), 0 states have call successors, (0), 0 states 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:16:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5118 transitions. [2025-03-16 15:16:31,291 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5118 transitions. Word has length 180 [2025-03-16 15:16:31,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:31,292 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 5118 transitions. [2025-03-16 15:16:31,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:16:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5118 transitions. [2025-03-16 15:16:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 15:16:31,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:31,295 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:16:31,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:16:31,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:31,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash -673913955, now seen corresponding path program 1 times [2025-03-16 15:16:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:31,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122518043] [2025-03-16 15:16:31,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:31,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 15:16:31,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 15:16:31,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:31,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:16:31,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:31,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122518043] [2025-03-16 15:16:31,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122518043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:31,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:31,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:31,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484251811] [2025-03-16 15:16:31,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:31,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:31,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:31,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:31,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:31,478 INFO L87 Difference]: Start difference. First operand 4381 states and 5118 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:16:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:32,812 INFO L93 Difference]: Finished difference Result 10044 states and 11705 transitions. [2025-03-16 15:16:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:32,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 246 [2025-03-16 15:16:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:32,826 INFO L225 Difference]: With dead ends: 10044 [2025-03-16 15:16:32,826 INFO L226 Difference]: Without dead ends: 5664 [2025-03-16 15:16:32,830 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:16:32,830 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 409 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:32,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 892 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:16:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2025-03-16 15:16:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5233. [2025-03-16 15:16:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 1.1588302752293578) internal successors, (6063), 5232 states have internal predecessors, (6063), 0 states have call successors, (0), 0 states 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:16:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 6063 transitions. [2025-03-16 15:16:32,889 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 6063 transitions. Word has length 246 [2025-03-16 15:16:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:32,889 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 6063 transitions. [2025-03-16 15:16:32,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:16:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 6063 transitions. [2025-03-16 15:16:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-16 15:16:32,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:32,892 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:16:32,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:16:32,893 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:32,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2146380386, now seen corresponding path program 1 times [2025-03-16 15:16:32,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:32,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028191135] [2025-03-16 15:16:32,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:32,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:32,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 15:16:32,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 15:16:32,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:32,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:16:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:33,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028191135] [2025-03-16 15:16:33,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028191135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:33,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:33,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033013249] [2025-03-16 15:16:33,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:33,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:33,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:33,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:33,094 INFO L87 Difference]: Start difference. First operand 5233 states and 6063 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:16:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:34,473 INFO L93 Difference]: Finished difference Result 13050 states and 15222 transitions. [2025-03-16 15:16:34,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:34,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 258 [2025-03-16 15:16:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:34,493 INFO L225 Difference]: With dead ends: 13050 [2025-03-16 15:16:34,493 INFO L226 Difference]: Without dead ends: 7390 [2025-03-16 15:16:34,499 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:16:34,500 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 495 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:34,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 627 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:16:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7390 states. [2025-03-16 15:16:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7390 to 6958. [2025-03-16 15:16:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6958 states, 6957 states have (on average 1.1637199942503953) internal successors, (8096), 6957 states have internal predecessors, (8096), 0 states have call successors, (0), 0 states 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:16:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 8096 transitions. [2025-03-16 15:16:34,575 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 8096 transitions. Word has length 258 [2025-03-16 15:16:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:34,576 INFO L471 AbstractCegarLoop]: Abstraction has 6958 states and 8096 transitions. [2025-03-16 15:16:34,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:16:34,577 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 8096 transitions. [2025-03-16 15:16:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-16 15:16:34,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:34,615 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:16:34,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:16:34,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:34,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash -55771567, now seen corresponding path program 1 times [2025-03-16 15:16:34,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:34,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619762955] [2025-03-16 15:16:34,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:34,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 15:16:34,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 15:16:34,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:34,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:16:34,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:34,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619762955] [2025-03-16 15:16:34,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619762955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:34,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:34,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591719220] [2025-03-16 15:16:34,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:34,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:34,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:34,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:34,745 INFO L87 Difference]: Start difference. First operand 6958 states and 8096 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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:16:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:35,956 INFO L93 Difference]: Finished difference Result 17315 states and 20392 transitions. [2025-03-16 15:16:35,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:35,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 263 [2025-03-16 15:16:35,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:35,972 INFO L225 Difference]: With dead ends: 17315 [2025-03-16 15:16:35,972 INFO L226 Difference]: Without dead ends: 10358 [2025-03-16 15:16:35,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:35,979 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 379 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:35,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 839 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:16:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10358 states. [2025-03-16 15:16:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10358 to 9508. [2025-03-16 15:16:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9508 states, 9507 states have (on average 1.1414747028505312) internal successors, (10852), 9507 states have internal predecessors, (10852), 0 states have call successors, (0), 0 states 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:16:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9508 states to 9508 states and 10852 transitions. [2025-03-16 15:16:36,060 INFO L78 Accepts]: Start accepts. Automaton has 9508 states and 10852 transitions. Word has length 263 [2025-03-16 15:16:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:36,061 INFO L471 AbstractCegarLoop]: Abstraction has 9508 states and 10852 transitions. [2025-03-16 15:16:36,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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:16:36,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9508 states and 10852 transitions. [2025-03-16 15:16:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 15:16:36,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:36,063 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:16:36,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:16:36,064 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:36,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1574374933, now seen corresponding path program 1 times [2025-03-16 15:16:36,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:36,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848871129] [2025-03-16 15:16:36,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:36,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:36,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 15:16:36,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 15:16:36,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:36,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:16:36,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:36,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848871129] [2025-03-16 15:16:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848871129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:36,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:36,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:36,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332754717] [2025-03-16 15:16:36,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:36,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:36,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:36,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:36,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:36,252 INFO L87 Difference]: Start difference. First operand 9508 states and 10852 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:16:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:37,643 INFO L93 Difference]: Finished difference Result 22431 states and 25677 transitions. [2025-03-16 15:16:37,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:37,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2025-03-16 15:16:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:37,664 INFO L225 Difference]: With dead ends: 22431 [2025-03-16 15:16:37,665 INFO L226 Difference]: Without dead ends: 12492 [2025-03-16 15:16:37,673 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:16:37,674 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 443 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:37,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 294 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:16:37,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12492 states. [2025-03-16 15:16:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12492 to 11636. [2025-03-16 15:16:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11636 states, 11635 states have (on average 1.147314138375591) internal successors, (13349), 11635 states have internal predecessors, (13349), 0 states have call successors, (0), 0 states 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:16:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11636 states to 11636 states and 13349 transitions. [2025-03-16 15:16:37,785 INFO L78 Accepts]: Start accepts. Automaton has 11636 states and 13349 transitions. Word has length 281 [2025-03-16 15:16:37,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:37,785 INFO L471 AbstractCegarLoop]: Abstraction has 11636 states and 13349 transitions. [2025-03-16 15:16:37,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:16:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 11636 states and 13349 transitions. [2025-03-16 15:16:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-16 15:16:37,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:37,789 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:16:37,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:16:37,790 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:37,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:37,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1152283262, now seen corresponding path program 1 times [2025-03-16 15:16:37,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:37,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052377143] [2025-03-16 15:16:37,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:37,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:37,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-16 15:16:37,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-16 15:16:37,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:37,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 227 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:16:38,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:38,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052377143] [2025-03-16 15:16:38,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052377143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:16:38,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136103551] [2025-03-16 15:16:38,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:38,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:16:38,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:16:38,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:16:38,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:16:38,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-16 15:16:38,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-16 15:16:38,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:38,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:38,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:16:38,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:16:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 192 proven. 82 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 15:16:38,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:16:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 192 proven. 82 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 15:16:39,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136103551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:16:39,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:16:39,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-16 15:16:39,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132053024] [2025-03-16 15:16:39,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:16:39,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:16:39,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:39,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:16:39,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:16:39,553 INFO L87 Difference]: Start difference. First operand 11636 states and 13349 transitions. Second operand has 9 states, 9 states have (on average 81.66666666666667) internal successors, (735), 9 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:16:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:48,297 INFO L93 Difference]: Finished difference Result 70609 states and 80044 transitions. [2025-03-16 15:16:48,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 15:16:48,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 81.66666666666667) internal successors, (735), 9 states have internal predecessors, (735), 0 states have call successors, (0), 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 286 [2025-03-16 15:16:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:48,368 INFO L225 Difference]: With dead ends: 70609 [2025-03-16 15:16:48,368 INFO L226 Difference]: Without dead ends: 54717 [2025-03-16 15:16:48,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-16 15:16:48,387 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 10975 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 10393 mSolverCounterSat, 2899 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10975 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 13292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2899 IncrementalHoareTripleChecker+Valid, 10393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:48,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10975 Valid, 457 Invalid, 13292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2899 Valid, 10393 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-03-16 15:16:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54717 states. [2025-03-16 15:16:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54717 to 46982. [2025-03-16 15:16:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46982 states, 46981 states have (on average 1.1231348843149358) internal successors, (52766), 46981 states have internal predecessors, (52766), 0 states have call successors, (0), 0 states 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:16:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46982 states to 46982 states and 52766 transitions. [2025-03-16 15:16:48,892 INFO L78 Accepts]: Start accepts. Automaton has 46982 states and 52766 transitions. Word has length 286 [2025-03-16 15:16:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:48,892 INFO L471 AbstractCegarLoop]: Abstraction has 46982 states and 52766 transitions. [2025-03-16 15:16:48,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.66666666666667) internal successors, (735), 9 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:16:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 46982 states and 52766 transitions. [2025-03-16 15:16:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-16 15:16:48,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:48,897 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:16:48,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:16:49,097 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,SelfDestructingSolverStorable10 [2025-03-16 15:16:49,097 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:49,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash 776253253, now seen corresponding path program 1 times [2025-03-16 15:16:49,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:49,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905229000] [2025-03-16 15:16:49,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:49,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:49,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-16 15:16:49,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-16 15:16:49,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:49,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 454 proven. 80 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 15:16:49,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:49,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905229000] [2025-03-16 15:16:49,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905229000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:16:49,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528637048] [2025-03-16 15:16:49,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:49,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:16:49,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:16:49,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:16:49,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:16:49,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-16 15:16:49,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-16 15:16:49,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:49,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:49,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:16:49,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:16:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 534 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 15:16:50,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:16:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528637048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:50,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:16:50,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-16 15:16:50,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900386201] [2025-03-16 15:16:50,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:50,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:16:50,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:50,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:16:50,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:16:50,033 INFO L87 Difference]: Start difference. First operand 46982 states and 52766 transitions. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:16:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:51,927 INFO L93 Difference]: Finished difference Result 93538 states and 105091 transitions. [2025-03-16 15:16:51,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:16:51,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 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 368 [2025-03-16 15:16:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:51,993 INFO L225 Difference]: With dead ends: 93538 [2025-03-16 15:16:51,994 INFO L226 Difference]: Without dead ends: 47407 [2025-03-16 15:16:52,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:16:52,027 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 841 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:52,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 351 Invalid, 2446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:16:52,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2025-03-16 15:16:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 46982. [2025-03-16 15:16:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46982 states, 46981 states have (on average 1.12236861710053) internal successors, (52730), 46981 states have internal predecessors, (52730), 0 states have call successors, (0), 0 states 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:16:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46982 states to 46982 states and 52730 transitions. [2025-03-16 15:16:52,522 INFO L78 Accepts]: Start accepts. Automaton has 46982 states and 52730 transitions. Word has length 368 [2025-03-16 15:16:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:52,522 INFO L471 AbstractCegarLoop]: Abstraction has 46982 states and 52730 transitions. [2025-03-16 15:16:52,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:16:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 46982 states and 52730 transitions. [2025-03-16 15:16:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-16 15:16:52,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:52,528 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:16:52,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:16:52,732 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 15:16:52,732 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:52,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1707192502, now seen corresponding path program 1 times [2025-03-16 15:16:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645711732] [2025-03-16 15:16:52,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:52,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-16 15:16:52,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-16 15:16:52,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:52,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 205 proven. 73 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 15:16:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645711732] [2025-03-16 15:16:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645711732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:16:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413491489] [2025-03-16 15:16:53,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:53,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:16:53,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:16:53,059 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 15:16:53,061 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 15:16:53,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-16 15:16:53,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-16 15:16:53,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:53,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:53,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:16:53,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:16:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 205 proven. 73 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 15:16:53,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:16:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 15:16:53,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413491489] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:16:53,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:16:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-16 15:16:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666957223] [2025-03-16 15:16:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:53,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:16:53,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:53,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:16:53,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:16:53,471 INFO L87 Difference]: Start difference. First operand 46982 states and 52730 transitions. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:16:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:55,625 INFO L93 Difference]: Finished difference Result 116966 states and 132133 transitions. [2025-03-16 15:16:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:16:55,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 389 [2025-03-16 15:16:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:55,694 INFO L225 Difference]: With dead ends: 116966 [2025-03-16 15:16:55,694 INFO L226 Difference]: Without dead ends: 70410 [2025-03-16 15:16:55,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 775 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:16:55,732 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 856 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:55,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 186 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:16:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70410 states. [2025-03-16 15:16:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70410 to 67856. [2025-03-16 15:16:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67856 states, 67855 states have (on average 1.1327094539827574) internal successors, (76860), 67855 states have internal predecessors, (76860), 0 states have call successors, (0), 0 states 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:16:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67856 states to 67856 states and 76860 transitions. [2025-03-16 15:16:56,445 INFO L78 Accepts]: Start accepts. Automaton has 67856 states and 76860 transitions. Word has length 389 [2025-03-16 15:16:56,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:56,445 INFO L471 AbstractCegarLoop]: Abstraction has 67856 states and 76860 transitions. [2025-03-16 15:16:56,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:16:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 67856 states and 76860 transitions. [2025-03-16 15:16:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-03-16 15:16:56,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:56,448 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:56,454 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 15:16:56,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:16:56,653 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash 136272264, now seen corresponding path program 1 times [2025-03-16 15:16:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:56,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297575340] [2025-03-16 15:16:56,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:56,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:56,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-03-16 15:16:56,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-03-16 15:16:56,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:56,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:16:56,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:56,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297575340] [2025-03-16 15:16:56,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297575340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:56,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:56,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:56,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408097804] [2025-03-16 15:16:56,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:56,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:56,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:56,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:56,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:56,820 INFO L87 Difference]: Start difference. First operand 67856 states and 76860 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:16:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:58,210 INFO L93 Difference]: Finished difference Result 134427 states and 152267 transitions. [2025-03-16 15:16:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:58,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 395 [2025-03-16 15:16:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:58,283 INFO L225 Difference]: With dead ends: 134427 [2025-03-16 15:16:58,283 INFO L226 Difference]: Without dead ends: 66572 [2025-03-16 15:16:58,324 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:16:58,324 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 477 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:58,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 730 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:16:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66572 states. [2025-03-16 15:16:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66572 to 66144. [2025-03-16 15:16:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66144 states, 66143 states have (on average 1.0991488139334473) internal successors, (72701), 66143 states have internal predecessors, (72701), 0 states have call successors, (0), 0 states 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:16:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66144 states to 66144 states and 72701 transitions. [2025-03-16 15:16:59,142 INFO L78 Accepts]: Start accepts. Automaton has 66144 states and 72701 transitions. Word has length 395 [2025-03-16 15:16:59,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:59,142 INFO L471 AbstractCegarLoop]: Abstraction has 66144 states and 72701 transitions. [2025-03-16 15:16:59,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:16:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 66144 states and 72701 transitions. [2025-03-16 15:16:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-16 15:16:59,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:59,149 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:16:59,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:16:59,149 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:59,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1995541350, now seen corresponding path program 1 times [2025-03-16 15:16:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:59,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857895221] [2025-03-16 15:16:59,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:59,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:59,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-16 15:16:59,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-16 15:16:59,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:59,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-03-16 15:16:59,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:59,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857895221] [2025-03-16 15:16:59,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857895221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:59,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:59,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:59,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185147649] [2025-03-16 15:16:59,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:59,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:59,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:59,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:59,350 INFO L87 Difference]: Start difference. First operand 66144 states and 72701 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:17:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:00,841 INFO L93 Difference]: Finished difference Result 142494 states and 156994 transitions. [2025-03-16 15:17:00,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:00,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 455 [2025-03-16 15:17:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:00,919 INFO L225 Difference]: With dead ends: 142494 [2025-03-16 15:17:00,919 INFO L226 Difference]: Without dead ends: 75922 [2025-03-16 15:17:00,956 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:17:00,957 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 468 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:00,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 731 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:17:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75922 states. [2025-03-16 15:17:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75922 to 73793. [2025-03-16 15:17:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73793 states, 73792 states have (on average 1.0937906548135299) internal successors, (80713), 73792 states have internal predecessors, (80713), 0 states have call successors, (0), 0 states 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:17:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73793 states to 73793 states and 80713 transitions. [2025-03-16 15:17:01,919 INFO L78 Accepts]: Start accepts. Automaton has 73793 states and 80713 transitions. Word has length 455 [2025-03-16 15:17:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:01,919 INFO L471 AbstractCegarLoop]: Abstraction has 73793 states and 80713 transitions. [2025-03-16 15:17:01,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:17:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 73793 states and 80713 transitions. [2025-03-16 15:17:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-16 15:17:01,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:01,927 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:01,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:17:01,928 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:01,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1738228248, now seen corresponding path program 1 times [2025-03-16 15:17:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:01,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998931360] [2025-03-16 15:17:01,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:01,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-16 15:17:02,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-16 15:17:02,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:02,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:17:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:02,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998931360] [2025-03-16 15:17:02,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998931360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:02,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:02,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:17:02,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677597627] [2025-03-16 15:17:02,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:02,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:02,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:02,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:02,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:17:02,316 INFO L87 Difference]: Start difference. First operand 73793 states and 80713 transitions. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:17:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:04,572 INFO L93 Difference]: Finished difference Result 190196 states and 207049 transitions. [2025-03-16 15:17:04,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:04,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 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 527 [2025-03-16 15:17:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:04,703 INFO L225 Difference]: With dead ends: 190196 [2025-03-16 15:17:04,703 INFO L226 Difference]: Without dead ends: 116404 [2025-03-16 15:17:04,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:17:04,754 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 787 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:04,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 200 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:17:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116404 states. [2025-03-16 15:17:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116404 to 96396. [2025-03-16 15:17:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96396 states, 96395 states have (on average 1.089081383889206) internal successors, (104982), 96395 states have internal predecessors, (104982), 0 states have call successors, (0), 0 states 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:17:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96396 states to 96396 states and 104982 transitions. [2025-03-16 15:17:06,087 INFO L78 Accepts]: Start accepts. Automaton has 96396 states and 104982 transitions. Word has length 527 [2025-03-16 15:17:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:06,087 INFO L471 AbstractCegarLoop]: Abstraction has 96396 states and 104982 transitions. [2025-03-16 15:17:06,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:17:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 96396 states and 104982 transitions. [2025-03-16 15:17:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-16 15:17:06,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:06,095 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:06,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:17:06,096 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:06,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash 58603719, now seen corresponding path program 1 times [2025-03-16 15:17:06,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:06,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885415136] [2025-03-16 15:17:06,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:06,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:06,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-16 15:17:06,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-16 15:17:06,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:06,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 713 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-03-16 15:17:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:06,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885415136] [2025-03-16 15:17:06,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885415136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:06,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:06,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:06,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765710103] [2025-03-16 15:17:06,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:06,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:06,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:06,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:06,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:06,427 INFO L87 Difference]: Start difference. First operand 96396 states and 104982 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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:17:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:08,060 INFO L93 Difference]: Finished difference Result 208126 states and 227147 transitions. [2025-03-16 15:17:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:08,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 529 [2025-03-16 15:17:08,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:08,194 INFO L225 Difference]: With dead ends: 208126 [2025-03-16 15:17:08,194 INFO L226 Difference]: Without dead ends: 111731 [2025-03-16 15:17:08,235 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:17:08,236 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 322 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:08,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 317 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:17:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111731 states. [2025-03-16 15:17:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111731 to 105328. [2025-03-16 15:17:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105328 states, 105327 states have (on average 1.076675496311487) internal successors, (113403), 105327 states have internal predecessors, (113403), 0 states have call successors, (0), 0 states 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:17:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105328 states to 105328 states and 113403 transitions. [2025-03-16 15:17:09,649 INFO L78 Accepts]: Start accepts. Automaton has 105328 states and 113403 transitions. Word has length 529 [2025-03-16 15:17:09,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:09,649 INFO L471 AbstractCegarLoop]: Abstraction has 105328 states and 113403 transitions. [2025-03-16 15:17:09,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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:17:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 105328 states and 113403 transitions. [2025-03-16 15:17:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-16 15:17:09,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:09,655 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:17:09,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:17:09,655 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:09,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:09,656 INFO L85 PathProgramCache]: Analyzing trace with hash -584011042, now seen corresponding path program 1 times [2025-03-16 15:17:09,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:09,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220721485] [2025-03-16 15:17:09,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:09,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:09,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-16 15:17:09,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-16 15:17:09,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:09,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-03-16 15:17:10,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:10,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220721485] [2025-03-16 15:17:10,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220721485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:10,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:10,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:10,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784780685] [2025-03-16 15:17:10,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:10,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:10,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:10,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:10,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:10,019 INFO L87 Difference]: Start difference. First operand 105328 states and 113403 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:17:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:11,791 INFO L93 Difference]: Finished difference Result 244796 states and 263393 transitions. [2025-03-16 15:17:11,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:11,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 542 [2025-03-16 15:17:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:11,928 INFO L225 Difference]: With dead ends: 244796 [2025-03-16 15:17:11,928 INFO L226 Difference]: Without dead ends: 139034 [2025-03-16 15:17:11,962 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:17:11,962 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 490 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:11,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 667 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:17:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139034 states. [2025-03-16 15:17:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139034 to 130049. [2025-03-16 15:17:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130049 states, 130048 states have (on average 1.0741264763779528) internal successors, (139688), 130048 states have internal predecessors, (139688), 0 states have call successors, (0), 0 states 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:17:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130049 states to 130049 states and 139688 transitions. [2025-03-16 15:17:13,529 INFO L78 Accepts]: Start accepts. Automaton has 130049 states and 139688 transitions. Word has length 542 [2025-03-16 15:17:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:13,529 INFO L471 AbstractCegarLoop]: Abstraction has 130049 states and 139688 transitions. [2025-03-16 15:17:13,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:17:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 130049 states and 139688 transitions. [2025-03-16 15:17:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2025-03-16 15:17:13,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:13,536 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:13,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:17:13,536 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:13,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash 90568050, now seen corresponding path program 1 times [2025-03-16 15:17:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:13,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834809708] [2025-03-16 15:17:13,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:13,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:13,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-03-16 15:17:13,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-03-16 15:17:13,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:13,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-16 15:17:13,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:13,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834809708] [2025-03-16 15:17:13,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834809708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:13,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:13,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:13,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885505014] [2025-03-16 15:17:13,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:13,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:13,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:13,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:13,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:13,997 INFO L87 Difference]: Start difference. First operand 130049 states and 139688 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:17:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:15,649 INFO L93 Difference]: Finished difference Result 266895 states and 286461 transitions. [2025-03-16 15:17:15,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:15,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 554 [2025-03-16 15:17:15,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:15,800 INFO L225 Difference]: With dead ends: 266895 [2025-03-16 15:17:15,800 INFO L226 Difference]: Without dead ends: 136422 [2025-03-16 15:17:15,857 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:17:15,858 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 346 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:15,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 357 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:17:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136422 states. [2025-03-16 15:17:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136422 to 127867. [2025-03-16 15:17:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127867 states, 127866 states have (on average 1.0685405033394335) internal successors, (136630), 127866 states have internal predecessors, (136630), 0 states have call successors, (0), 0 states 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:17:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127867 states to 127867 states and 136630 transitions. [2025-03-16 15:17:17,647 INFO L78 Accepts]: Start accepts. Automaton has 127867 states and 136630 transitions. Word has length 554 [2025-03-16 15:17:17,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:17,647 INFO L471 AbstractCegarLoop]: Abstraction has 127867 states and 136630 transitions. [2025-03-16 15:17:17,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:17:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 127867 states and 136630 transitions. [2025-03-16 15:17:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-03-16 15:17:17,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:17,655 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:17,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:17:17,655 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:17,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash 705891606, now seen corresponding path program 1 times [2025-03-16 15:17:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:17,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453950960] [2025-03-16 15:17:17,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:17,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-03-16 15:17:17,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-03-16 15:17:17,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:17,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:17:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:18,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453950960] [2025-03-16 15:17:18,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453950960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:18,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:18,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:18,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706548350] [2025-03-16 15:17:18,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:18,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:18,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:18,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:18,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:18,134 INFO L87 Difference]: Start difference. First operand 127867 states and 136630 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:17:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:20,023 INFO L93 Difference]: Finished difference Result 266818 states and 285109 transitions. [2025-03-16 15:17:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:20,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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 588 [2025-03-16 15:17:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:20,383 INFO L225 Difference]: With dead ends: 266818 [2025-03-16 15:17:20,383 INFO L226 Difference]: Without dead ends: 138526 [2025-03-16 15:17:20,438 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:17:20,438 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 456 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:20,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 220 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:17:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138526 states. [2025-03-16 15:17:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138526 to 129571. [2025-03-16 15:17:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129571 states, 129570 states have (on average 1.0684494867639114) internal successors, (138439), 129570 states have internal predecessors, (138439), 0 states have call successors, (0), 0 states 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:17:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129571 states to 129571 states and 138439 transitions. [2025-03-16 15:17:21,776 INFO L78 Accepts]: Start accepts. Automaton has 129571 states and 138439 transitions. Word has length 588 [2025-03-16 15:17:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:21,777 INFO L471 AbstractCegarLoop]: Abstraction has 129571 states and 138439 transitions. [2025-03-16 15:17:21,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:17:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 129571 states and 138439 transitions. [2025-03-16 15:17:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-16 15:17:21,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:21,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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:21,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:17:21,786 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:21,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:21,786 INFO L85 PathProgramCache]: Analyzing trace with hash 181316637, now seen corresponding path program 1 times [2025-03-16 15:17:21,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:21,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129010759] [2025-03-16 15:17:21,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:21,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:21,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-16 15:17:21,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-16 15:17:21,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:21,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 406 proven. 72 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:17:22,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:22,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129010759] [2025-03-16 15:17:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129010759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:22,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304543903] [2025-03-16 15:17:22,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:22,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:22,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:22,463 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:17:22,465 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:17:22,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-16 15:17:22,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-16 15:17:22,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:22,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:22,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:17:22,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 289 proven. 25 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:17:22,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:17:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:17:22,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304543903] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:22,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:17:22,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-03-16 15:17:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495782816] [2025-03-16 15:17:22,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:22,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:22,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:22,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:22,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:17:22,945 INFO L87 Difference]: Start difference. First operand 129571 states and 138439 transitions. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:17:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:25,397 INFO L93 Difference]: Finished difference Result 273200 states and 291726 transitions. [2025-03-16 15:17:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:25,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 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 593 [2025-03-16 15:17:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:25,545 INFO L225 Difference]: With dead ends: 273200 [2025-03-16 15:17:25,545 INFO L226 Difference]: Without dead ends: 141927 [2025-03-16 15:17:25,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 1182 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:17:25,612 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 912 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:25,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 204 Invalid, 2650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:17:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141927 states. [2025-03-16 15:17:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141927 to 138934. [2025-03-16 15:17:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138934 states, 138933 states have (on average 1.0681263630670899) internal successors, (148398), 138933 states have internal predecessors, (148398), 0 states have call successors, (0), 0 states 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:17:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138934 states to 138934 states and 148398 transitions. [2025-03-16 15:17:27,195 INFO L78 Accepts]: Start accepts. Automaton has 138934 states and 148398 transitions. Word has length 593 [2025-03-16 15:17:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:27,195 INFO L471 AbstractCegarLoop]: Abstraction has 138934 states and 148398 transitions. [2025-03-16 15:17:27,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:17:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 138934 states and 148398 transitions. [2025-03-16 15:17:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-03-16 15:17:27,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:27,207 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:27,214 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:17:27,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:27,408 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:27,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1436463714, now seen corresponding path program 1 times [2025-03-16 15:17:27,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:27,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315274557] [2025-03-16 15:17:27,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:27,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:27,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-03-16 15:17:27,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-03-16 15:17:27,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:27,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2025-03-16 15:17:27,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315274557] [2025-03-16 15:17:27,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315274557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:27,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:27,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:17:27,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262133215] [2025-03-16 15:17:27,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:27,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:27,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:27,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:27,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:27,926 INFO L87 Difference]: Start difference. First operand 138934 states and 148398 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 2 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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:17:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:29,161 INFO L93 Difference]: Finished difference Result 270609 states and 288852 transitions. [2025-03-16 15:17:29,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:29,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 2 states have internal predecessors, (288), 0 states have call successors, (0), 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 602 [2025-03-16 15:17:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:29,323 INFO L225 Difference]: With dead ends: 270609 [2025-03-16 15:17:29,323 INFO L226 Difference]: Without dead ends: 131674 [2025-03-16 15:17:29,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:29,388 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 539 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:29,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 97 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:17:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131674 states. [2025-03-16 15:17:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131674 to 130800. [2025-03-16 15:17:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130800 states, 130799 states have (on average 1.066391944892545) internal successors, (139483), 130799 states have internal predecessors, (139483), 0 states have call successors, (0), 0 states 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:17:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130800 states to 130800 states and 139483 transitions. [2025-03-16 15:17:30,865 INFO L78 Accepts]: Start accepts. Automaton has 130800 states and 139483 transitions. Word has length 602 [2025-03-16 15:17:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:30,865 INFO L471 AbstractCegarLoop]: Abstraction has 130800 states and 139483 transitions. [2025-03-16 15:17:30,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 2 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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:17:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 130800 states and 139483 transitions. [2025-03-16 15:17:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2025-03-16 15:17:30,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:30,873 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:30,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:17:30,873 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:30,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:30,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1558492303, now seen corresponding path program 1 times [2025-03-16 15:17:30,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:30,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399950088] [2025-03-16 15:17:30,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:30,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:30,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-03-16 15:17:30,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-03-16 15:17:30,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:30,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 427 proven. 89 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:17:31,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:31,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399950088] [2025-03-16 15:17:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399950088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520763087] [2025-03-16 15:17:31,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:31,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:31,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:31,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:17:31,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:17:31,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-03-16 15:17:31,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-03-16 15:17:31,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:31,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:31,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:17:31,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 327 proven. 25 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:17:31,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:17:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:17:31,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520763087] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:31,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:17:31,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-03-16 15:17:31,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210224049] [2025-03-16 15:17:31,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:31,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:31,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:31,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:31,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:17:31,942 INFO L87 Difference]: Start difference. First operand 130800 states and 139483 transitions. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:17:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:34,070 INFO L93 Difference]: Finished difference Result 133792 states and 142553 transitions. [2025-03-16 15:17:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:34,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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 610 [2025-03-16 15:17:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:34,214 INFO L225 Difference]: With dead ends: 133792 [2025-03-16 15:17:34,214 INFO L226 Difference]: Without dead ends: 133365 [2025-03-16 15:17:34,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1223 GetRequests, 1216 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:17:34,246 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 973 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:34,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 166 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 2162 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:17:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133365 states. [2025-03-16 15:17:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133365 to 130800. [2025-03-16 15:17:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130800 states, 130799 states have (on average 1.0662084572512023) internal successors, (139459), 130799 states have internal predecessors, (139459), 0 states have call successors, (0), 0 states 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:17:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130800 states to 130800 states and 139459 transitions. [2025-03-16 15:17:35,868 INFO L78 Accepts]: Start accepts. Automaton has 130800 states and 139459 transitions. Word has length 610 [2025-03-16 15:17:35,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:35,869 INFO L471 AbstractCegarLoop]: Abstraction has 130800 states and 139459 transitions. [2025-03-16 15:17:35,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:17:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 130800 states and 139459 transitions. [2025-03-16 15:17:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-03-16 15:17:35,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:35,877 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:35,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:17:36,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 15:17:36,078 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:36,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash 543356429, now seen corresponding path program 1 times [2025-03-16 15:17:36,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:36,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445503441] [2025-03-16 15:17:36,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:36,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:36,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-03-16 15:17:36,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-03-16 15:17:36,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:36,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-03-16 15:17:36,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:36,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445503441] [2025-03-16 15:17:36,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445503441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:36,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:36,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:17:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861843727] [2025-03-16 15:17:36,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:36,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:36,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:36,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:36,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:17:36,646 INFO L87 Difference]: Start difference. First operand 130800 states and 139459 transitions. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)