./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label14.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6b9a8cf062c769ab6372057423b232460c4eac80bd30ee0857d87935f050ecf1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:51:27,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:51:27,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:51:27,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:51:27,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:51:27,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:51:27,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:51:27,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:51:27,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:51:27,197 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:51:27,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:51:27,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:51:27,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:51:27,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:51:27,198 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:51:27,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:51:27,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:51:27,199 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:51:27,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:51:27,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:51:27,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:51:27,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:51:27,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:51:27,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:51:27,200 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:51:27,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:51:27,200 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:51:27,200 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:51:27,200 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:51:27,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:51:27,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:51:27,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:51:27,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:27,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:51:27,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:51:27,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:51:27,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:51:27,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:27,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:51:27,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:51:27,201 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:51:27,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:51:27,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:51:27,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:51:27,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:51:27,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:51:27,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:51:27,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:51:27,202 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-jdk21/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 -> 6b9a8cf062c769ab6372057423b232460c4eac80bd30ee0857d87935f050ecf1 [2025-01-08 23:51:27,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:51:27,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:51:27,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:51:27,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:51:27,436 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:51:27,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label14.c [2025-01-08 23:51:28,596 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9980c4e94/b8e553d18304499ebc085afebaaf03ea/FLAGae03147e3 [2025-01-08 23:51:29,024 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:51:29,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label14.c [2025-01-08 23:51:29,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9980c4e94/b8e553d18304499ebc085afebaaf03ea/FLAGae03147e3 [2025-01-08 23:51:29,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9980c4e94/b8e553d18304499ebc085afebaaf03ea [2025-01-08 23:51:29,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:51:29,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:51:29,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:51:29,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:51:29,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:51:29,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:29,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c462a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29, skipping insertion in model container [2025-01-08 23:51:29,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:29,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:51:29,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label14.c[5911,5924] [2025-01-08 23:51:29,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:51:30,004 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:51:30,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label14.c[5911,5924] [2025-01-08 23:51:30,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:51:30,354 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:51:30,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30 WrapperNode [2025-01-08 23:51:30,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:51:30,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:51:30,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:51:30,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:51:30,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:30,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:30,718 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:51:30,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:51:30,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:51:30,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:51:30,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:51:30,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:30,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:30,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:31,023 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-01-08 23:51:31,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:31,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:31,114 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:31,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:31,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:31,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:31,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:31,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:51:31,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:51:31,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:51:31,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:51:31,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (1/1) ... [2025-01-08 23:51:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:31,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:51:31,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:51:31,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:51:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:51:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:51:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:51:31,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:51:31,355 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:51:31,356 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:51:35,198 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:51:35,198 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:51:35,228 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:51:35,228 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:51:35,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:51:35 BoogieIcfgContainer [2025-01-08 23:51:35,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:51:35,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:51:35,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:51:35,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:51:35,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:51:29" (1/3) ... [2025-01-08 23:51:35,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5359ec5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:51:35, skipping insertion in model container [2025-01-08 23:51:35,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:30" (2/3) ... [2025-01-08 23:51:35,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5359ec5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:51:35, skipping insertion in model container [2025-01-08 23:51:35,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:51:35" (3/3) ... [2025-01-08 23:51:35,239 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label14.c [2025-01-08 23:51:35,253 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:51:35,255 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label14.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:51:35,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:51:35,337 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;@35a84936, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:51:35,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:51:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-08 23:51:35,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:35,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:35,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1939637972, now seen corresponding path program 1 times [2025-01-08 23:51:35,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:35,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490562890] [2025-01-08 23:51:35,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:35,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:35,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-08 23:51:35,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 23:51:35,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:35,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:35,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:35,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490562890] [2025-01-08 23:51:35,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490562890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:35,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:35,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:35,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079587984] [2025-01-08 23:51:35,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:35,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:51:35,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:35,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:51:35,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:51:35,744 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:41,128 INFO L93 Difference]: Finished difference Result 3829 states and 7202 transitions. [2025-01-08 23:51:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:51:41,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-08 23:51:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:41,144 INFO L225 Difference]: With dead ends: 3829 [2025-01-08 23:51:41,144 INFO L226 Difference]: Without dead ends: 2664 [2025-01-08 23:51:41,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:51:41,150 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 2711 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2711 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 5853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:41,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2711 Valid, 1059 Invalid, 5853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 4246 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-08 23:51:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-01-08 23:51:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2025-01-08 23:51:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.460931630353118) internal successors, (3889), 2662 states have internal predecessors, (3889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3889 transitions. [2025-01-08 23:51:41,227 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3889 transitions. Word has length 41 [2025-01-08 23:51:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:41,228 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3889 transitions. [2025-01-08 23:51:41,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3889 transitions. [2025-01-08 23:51:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-08 23:51:41,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:41,232 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:41,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:51:41,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:41,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1667131471, now seen corresponding path program 1 times [2025-01-08 23:51:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:41,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730617448] [2025-01-08 23:51:41,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:41,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:41,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-08 23:51:41,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-08 23:51:41,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:41,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-08 23:51:41,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:41,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730617448] [2025-01-08 23:51:41,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730617448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:41,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:41,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:41,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601312221] [2025-01-08 23:51:41,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:41,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:41,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:41,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:41,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:41,475 INFO L87 Difference]: Start difference. First operand 2663 states and 3889 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:44,779 INFO L93 Difference]: Finished difference Result 6142 states and 9712 transitions. [2025-01-08 23:51:44,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:44,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 166 [2025-01-08 23:51:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:44,797 INFO L225 Difference]: With dead ends: 6142 [2025-01-08 23:51:44,798 INFO L226 Difference]: Without dead ends: 4268 [2025-01-08 23:51:44,800 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-01-08 23:51:44,800 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 743 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:44,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1189 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:51:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2025-01-08 23:51:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4254. [2025-01-08 23:51:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4254 states, 4253 states have (on average 1.3515165765342112) internal successors, (5748), 4253 states have internal predecessors, (5748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4254 states to 4254 states and 5748 transitions. [2025-01-08 23:51:44,857 INFO L78 Accepts]: Start accepts. Automaton has 4254 states and 5748 transitions. Word has length 166 [2025-01-08 23:51:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:44,858 INFO L471 AbstractCegarLoop]: Abstraction has 4254 states and 5748 transitions. [2025-01-08 23:51:44,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 4254 states and 5748 transitions. [2025-01-08 23:51:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-08 23:51:44,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:44,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, 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, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:44,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:51:44,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:44,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1430893949, now seen corresponding path program 1 times [2025-01-08 23:51:44,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:44,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809332494] [2025-01-08 23:51:44,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:44,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:44,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-08 23:51:44,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-08 23:51:44,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:44,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 23:51:45,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:45,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809332494] [2025-01-08 23:51:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809332494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:45,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:45,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:45,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411920586] [2025-01-08 23:51:45,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:45,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:45,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:45,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:45,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:45,022 INFO L87 Difference]: Start difference. First operand 4254 states and 5748 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:47,952 INFO L93 Difference]: Finished difference Result 10897 states and 15274 transitions. [2025-01-08 23:51:47,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:47,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-01-08 23:51:47,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:47,976 INFO L225 Difference]: With dead ends: 10897 [2025-01-08 23:51:47,976 INFO L226 Difference]: Without dead ends: 7432 [2025-01-08 23:51:47,980 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-01-08 23:51:47,983 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 905 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 755 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:47,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 954 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [755 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:51:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7432 states. [2025-01-08 23:51:48,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7432 to 7426. [2025-01-08 23:51:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7426 states, 7425 states have (on average 1.288888888888889) internal successors, (9570), 7425 states have internal predecessors, (9570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 9570 transitions. [2025-01-08 23:51:48,080 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 9570 transitions. Word has length 208 [2025-01-08 23:51:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:48,081 INFO L471 AbstractCegarLoop]: Abstraction has 7426 states and 9570 transitions. [2025-01-08 23:51:48,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 9570 transitions. [2025-01-08 23:51:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-08 23:51:48,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:48,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-08 23:51:48,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:51:48,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:48,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash 512628614, now seen corresponding path program 1 times [2025-01-08 23:51:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:48,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65594501] [2025-01-08 23:51:48,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:48,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:48,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-08 23:51:48,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-08 23:51:48,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:48,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:51:48,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:48,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65594501] [2025-01-08 23:51:48,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65594501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:48,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:48,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:48,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930012481] [2025-01-08 23:51:48,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:48,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:48,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:48,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:48,270 INFO L87 Difference]: Start difference. First operand 7426 states and 9570 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:51,671 INFO L93 Difference]: Finished difference Result 19619 states and 25904 transitions. [2025-01-08 23:51:51,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:51,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2025-01-08 23:51:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:51,702 INFO L225 Difference]: With dead ends: 19619 [2025-01-08 23:51:51,702 INFO L226 Difference]: Without dead ends: 12982 [2025-01-08 23:51:51,712 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-01-08 23:51:51,713 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 907 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2889 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 3429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:51,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 641 Invalid, 3429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2889 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:51:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12982 states. [2025-01-08 23:51:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12982 to 12975. [2025-01-08 23:51:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12975 states, 12974 states have (on average 1.2719284723292739) internal successors, (16502), 12974 states have internal predecessors, (16502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 16502 transitions. [2025-01-08 23:51:51,853 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 16502 transitions. Word has length 222 [2025-01-08 23:51:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:51,853 INFO L471 AbstractCegarLoop]: Abstraction has 12975 states and 16502 transitions. [2025-01-08 23:51:51,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 16502 transitions. [2025-01-08 23:51:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-08 23:51:51,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:51,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-08 23:51:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:51:51,857 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:51,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1032009245, now seen corresponding path program 1 times [2025-01-08 23:51:51,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816637883] [2025-01-08 23:51:51,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:51,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-08 23:51:51,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-08 23:51:51,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:51,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:52,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:52,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816637883] [2025-01-08 23:51:52,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816637883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:52,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:52,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:52,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068721755] [2025-01-08 23:51:52,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:52,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:51:52,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:52,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:51:52,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:51:52,067 INFO L87 Difference]: Start difference. First operand 12975 states and 16502 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:58,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:58,179 INFO L93 Difference]: Finished difference Result 45028 states and 58433 transitions. [2025-01-08 23:51:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:51:58,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2025-01-08 23:51:58,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:58,237 INFO L225 Difference]: With dead ends: 45028 [2025-01-08 23:51:58,238 INFO L226 Difference]: Without dead ends: 32842 [2025-01-08 23:51:58,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:51:58,252 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 1620 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 6075 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 6698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 6075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:58,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 1149 Invalid, 6698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 6075 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-01-08 23:51:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32842 states. [2025-01-08 23:51:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32842 to 32694. [2025-01-08 23:51:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32694 states, 32693 states have (on average 1.2305692350044353) internal successors, (40231), 32693 states have internal predecessors, (40231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 40231 transitions. [2025-01-08 23:51:58,550 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 40231 transitions. Word has length 238 [2025-01-08 23:51:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:58,550 INFO L471 AbstractCegarLoop]: Abstraction has 32694 states and 40231 transitions. [2025-01-08 23:51:58,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 40231 transitions. [2025-01-08 23:51:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-01-08 23:51:58,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:58,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:51:58,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:51:58,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:58,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1620913658, now seen corresponding path program 1 times [2025-01-08 23:51:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:58,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213780691] [2025-01-08 23:51:58,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:58,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-01-08 23:51:58,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-01-08 23:51:58,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:58,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-08 23:51:58,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:58,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213780691] [2025-01-08 23:51:58,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213780691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:58,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:58,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090887774] [2025-01-08 23:51:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:58,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:58,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:58,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:58,822 INFO L87 Difference]: Start difference. First operand 32694 states and 40231 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 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-01-08 23:52:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:02,055 INFO L93 Difference]: Finished difference Result 87418 states and 108575 transitions. [2025-01-08 23:52:02,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:02,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 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 259 [2025-01-08 23:52:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:02,142 INFO L225 Difference]: With dead ends: 87418 [2025-01-08 23:52:02,142 INFO L226 Difference]: Without dead ends: 55513 [2025-01-08 23:52:02,174 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-01-08 23:52:02,177 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 859 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:02,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 984 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:52:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55513 states. [2025-01-08 23:52:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55513 to 52360. [2025-01-08 23:52:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52360 states, 52359 states have (on average 1.1841708206803032) internal successors, (62002), 52359 states have internal predecessors, (62002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52360 states to 52360 states and 62002 transitions. [2025-01-08 23:52:02,888 INFO L78 Accepts]: Start accepts. Automaton has 52360 states and 62002 transitions. Word has length 259 [2025-01-08 23:52:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:02,889 INFO L471 AbstractCegarLoop]: Abstraction has 52360 states and 62002 transitions. [2025-01-08 23:52:02,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 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-01-08 23:52:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 52360 states and 62002 transitions. [2025-01-08 23:52:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-01-08 23:52:02,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:02,893 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:02,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:52:02,894 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:02,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:02,894 INFO L85 PathProgramCache]: Analyzing trace with hash -253757299, now seen corresponding path program 1 times [2025-01-08 23:52:02,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:02,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412727217] [2025-01-08 23:52:02,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:02,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-01-08 23:52:02,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-01-08 23:52:02,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:02,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 23:52:03,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:03,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412727217] [2025-01-08 23:52:03,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412727217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:03,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:03,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:03,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051964072] [2025-01-08 23:52:03,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:03,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:03,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:03,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:03,026 INFO L87 Difference]: Start difference. First operand 52360 states and 62002 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:06,190 INFO L93 Difference]: Finished difference Result 127552 states and 153812 transitions. [2025-01-08 23:52:06,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:06,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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-01-08 23:52:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:06,275 INFO L225 Difference]: With dead ends: 127552 [2025-01-08 23:52:06,276 INFO L226 Difference]: Without dead ends: 75981 [2025-01-08 23:52:06,298 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-01-08 23:52:06,299 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 887 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:06,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 930 Invalid, 3294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:52:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75981 states. [2025-01-08 23:52:06,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75981 to 74397. [2025-01-08 23:52:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74397 states, 74396 states have (on average 1.1729662885101348) internal successors, (87264), 74396 states have internal predecessors, (87264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74397 states to 74397 states and 87264 transitions. [2025-01-08 23:52:06,870 INFO L78 Accepts]: Start accepts. Automaton has 74397 states and 87264 transitions. Word has length 281 [2025-01-08 23:52:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:06,871 INFO L471 AbstractCegarLoop]: Abstraction has 74397 states and 87264 transitions. [2025-01-08 23:52:06,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 74397 states and 87264 transitions. [2025-01-08 23:52:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-08 23:52:06,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:06,875 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:06,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:52:06,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:06,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:06,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1048109703, now seen corresponding path program 1 times [2025-01-08 23:52:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:06,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6620070] [2025-01-08 23:52:06,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:06,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:06,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-08 23:52:06,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-08 23:52:06,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:06,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 23:52:07,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:07,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6620070] [2025-01-08 23:52:07,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6620070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:07,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:07,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:07,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029580662] [2025-01-08 23:52:07,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:07,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:52:07,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:07,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:52:07,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:52:07,201 INFO L87 Difference]: Start difference. First operand 74397 states and 87264 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:13,396 INFO L93 Difference]: Finished difference Result 199386 states and 235954 transitions. [2025-01-08 23:52:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:52:13,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 329 [2025-01-08 23:52:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:13,538 INFO L225 Difference]: With dead ends: 199386 [2025-01-08 23:52:13,538 INFO L226 Difference]: Without dead ends: 125778 [2025-01-08 23:52:13,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:52:13,585 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1735 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 6629 mSolverCounterSat, 1137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 7766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1137 IncrementalHoareTripleChecker+Valid, 6629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:13,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 699 Invalid, 7766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1137 Valid, 6629 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-01-08 23:52:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125778 states. [2025-01-08 23:52:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125778 to 125647. [2025-01-08 23:52:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125647 states, 125646 states have (on average 1.1678525380831861) internal successors, (146736), 125646 states have internal predecessors, (146736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125647 states to 125647 states and 146736 transitions. [2025-01-08 23:52:15,063 INFO L78 Accepts]: Start accepts. Automaton has 125647 states and 146736 transitions. Word has length 329 [2025-01-08 23:52:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:15,064 INFO L471 AbstractCegarLoop]: Abstraction has 125647 states and 146736 transitions. [2025-01-08 23:52:15,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 125647 states and 146736 transitions. [2025-01-08 23:52:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-01-08 23:52:15,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:15,069 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:52:15,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:52:15,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:15,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1027553973, now seen corresponding path program 1 times [2025-01-08 23:52:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:15,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752774811] [2025-01-08 23:52:15,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:15,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:15,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-08 23:52:15,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-08 23:52:15,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:15,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 316 proven. 25 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 23:52:15,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:15,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752774811] [2025-01-08 23:52:15,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752774811] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:15,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503437703] [2025-01-08 23:52:15,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:15,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:15,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:15,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:52:15,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:52:15,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-08 23:52:15,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-08 23:52:15,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:15,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:15,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:52:15,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 23:52:16,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503437703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:16,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:16,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:52:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965695815] [2025-01-08 23:52:16,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:16,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:16,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:16,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:16,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:52:16,293 INFO L87 Difference]: Start difference. First operand 125647 states and 146736 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:20,037 INFO L93 Difference]: Finished difference Result 299286 states and 353524 transitions. [2025-01-08 23:52:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:20,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 338 [2025-01-08 23:52:20,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:20,230 INFO L225 Difference]: With dead ends: 299286 [2025-01-08 23:52:20,231 INFO L226 Difference]: Without dead ends: 188606 [2025-01-08 23:52:20,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:52:20,308 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 736 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:20,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1128 Invalid, 3222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:52:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188606 states. [2025-01-08 23:52:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188606 to 132694. [2025-01-08 23:52:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132694 states, 132693 states have (on average 1.1432479482715743) internal successors, (151701), 132693 states have internal predecessors, (151701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132694 states to 132694 states and 151701 transitions. [2025-01-08 23:52:22,579 INFO L78 Accepts]: Start accepts. Automaton has 132694 states and 151701 transitions. Word has length 338 [2025-01-08 23:52:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:22,579 INFO L471 AbstractCegarLoop]: Abstraction has 132694 states and 151701 transitions. [2025-01-08 23:52:22,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 132694 states and 151701 transitions. [2025-01-08 23:52:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-01-08 23:52:22,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:22,584 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:22,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:52:22,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:22,785 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:22,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash -463883687, now seen corresponding path program 1 times [2025-01-08 23:52:22,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:22,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266600626] [2025-01-08 23:52:22,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:22,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-01-08 23:52:22,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-01-08 23:52:22,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:22,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 300 proven. 113 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 23:52:23,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:23,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266600626] [2025-01-08 23:52:23,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266600626] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:23,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83857719] [2025-01-08 23:52:23,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:23,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:23,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:23,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:52:23,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:52:24,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-01-08 23:52:24,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-01-08 23:52:24,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:24,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:24,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:52:24,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-01-08 23:52:24,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83857719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:24,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:24,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:52:24,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791601024] [2025-01-08 23:52:24,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:24,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:24,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:24,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:24,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:24,263 INFO L87 Difference]: Start difference. First operand 132694 states and 151701 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:27,308 INFO L93 Difference]: Finished difference Result 264597 states and 302607 transitions. [2025-01-08 23:52:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:27,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 396 [2025-01-08 23:52:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:27,452 INFO L225 Difference]: With dead ends: 264597 [2025-01-08 23:52:27,452 INFO L226 Difference]: Without dead ends: 132692 [2025-01-08 23:52:27,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:27,523 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1092 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:27,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1440 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:52:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132692 states. [2025-01-08 23:52:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132692 to 130330. [2025-01-08 23:52:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130330 states, 130329 states have (on average 1.1049190893814884) internal successors, (144003), 130329 states have internal predecessors, (144003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130330 states to 130330 states and 144003 transitions. [2025-01-08 23:52:28,974 INFO L78 Accepts]: Start accepts. Automaton has 130330 states and 144003 transitions. Word has length 396 [2025-01-08 23:52:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:28,974 INFO L471 AbstractCegarLoop]: Abstraction has 130330 states and 144003 transitions. [2025-01-08 23:52:28,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 130330 states and 144003 transitions. [2025-01-08 23:52:28,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-08 23:52:28,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:28,981 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 23:52:28,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:52:29,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:29,182 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:29,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:29,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2079181976, now seen corresponding path program 1 times [2025-01-08 23:52:29,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:29,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607509507] [2025-01-08 23:52:29,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:29,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:29,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-08 23:52:29,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-08 23:52:29,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:29,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:52:29,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:29,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607509507] [2025-01-08 23:52:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607509507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:29,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030341413] [2025-01-08 23:52:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:29,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:29,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:29,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:29,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:29,613 INFO L87 Difference]: Start difference. First operand 130330 states and 144003 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:33,614 INFO L93 Difference]: Finished difference Result 294513 states and 328558 transitions. [2025-01-08 23:52:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:33,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2025-01-08 23:52:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:33,824 INFO L225 Difference]: With dead ends: 294513 [2025-01-08 23:52:33,824 INFO L226 Difference]: Without dead ends: 164972 [2025-01-08 23:52:33,900 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-01-08 23:52:33,900 INFO L435 NwaCegarLoop]: 1808 mSDtfsCounter, 776 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:33,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1959 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:52:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164972 states. [2025-01-08 23:52:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164972 to 161806. [2025-01-08 23:52:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161806 states, 161805 states have (on average 1.0906461481412812) internal successors, (176472), 161805 states have internal predecessors, (176472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161806 states to 161806 states and 176472 transitions. [2025-01-08 23:52:35,710 INFO L78 Accepts]: Start accepts. Automaton has 161806 states and 176472 transitions. Word has length 435 [2025-01-08 23:52:35,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:35,712 INFO L471 AbstractCegarLoop]: Abstraction has 161806 states and 176472 transitions. [2025-01-08 23:52:35,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 161806 states and 176472 transitions. [2025-01-08 23:52:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-01-08 23:52:35,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:35,719 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 3, 3, 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] [2025-01-08 23:52:35,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:52:35,720 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:35,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash 401058081, now seen corresponding path program 1 times [2025-01-08 23:52:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:35,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514904259] [2025-01-08 23:52:35,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:35,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:35,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-08 23:52:35,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-08 23:52:35,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:35,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-01-08 23:52:35,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:35,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514904259] [2025-01-08 23:52:35,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514904259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:35,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:35,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807040385] [2025-01-08 23:52:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:35,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:35,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:35,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:35,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:35,866 INFO L87 Difference]: Start difference. First operand 161806 states and 176472 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:40,503 INFO L93 Difference]: Finished difference Result 354316 states and 389645 transitions. [2025-01-08 23:52:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:40,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 444 [2025-01-08 23:52:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:40,727 INFO L225 Difference]: With dead ends: 354316 [2025-01-08 23:52:40,727 INFO L226 Difference]: Without dead ends: 193299 [2025-01-08 23:52:40,783 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-01-08 23:52:40,783 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 956 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 995 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 995 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:40,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 788 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [995 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-08 23:52:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193299 states. [2025-01-08 23:52:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193299 to 190134. [2025-01-08 23:52:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190134 states, 190133 states have (on average 1.0950808118527557) internal successors, (208211), 190133 states have internal predecessors, (208211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190134 states to 190134 states and 208211 transitions. [2025-01-08 23:52:42,779 INFO L78 Accepts]: Start accepts. Automaton has 190134 states and 208211 transitions. Word has length 444 [2025-01-08 23:52:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:42,779 INFO L471 AbstractCegarLoop]: Abstraction has 190134 states and 208211 transitions. [2025-01-08 23:52:42,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 190134 states and 208211 transitions. [2025-01-08 23:52:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-01-08 23:52:42,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:42,794 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:42,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:52:42,794 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:42,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:42,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1734437721, now seen corresponding path program 1 times [2025-01-08 23:52:42,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:42,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243474529] [2025-01-08 23:52:42,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:42,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:42,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-08 23:52:43,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-08 23:52:43,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:43,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 242 proven. 110 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 23:52:44,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243474529] [2025-01-08 23:52:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243474529] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:44,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526116689] [2025-01-08 23:52:44,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:44,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:44,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:44,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:52:44,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:52:44,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-08 23:52:44,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-08 23:52:44,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:44,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:44,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:52:44,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-01-08 23:52:44,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:44,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526116689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:44,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:44,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:52:44,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76365192] [2025-01-08 23:52:44,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:44,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:44,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:44,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:44,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:52:44,927 INFO L87 Difference]: Start difference. First operand 190134 states and 208211 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:48,317 INFO L93 Difference]: Finished difference Result 384215 states and 420559 transitions. [2025-01-08 23:52:48,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:48,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 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 506 [2025-01-08 23:52:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:48,563 INFO L225 Difference]: With dead ends: 384215 [2025-01-08 23:52:48,564 INFO L226 Difference]: Without dead ends: 194870 [2025-01-08 23:52:48,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:52:48,676 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 547 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:48,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1179 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:52:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194870 states. [2025-01-08 23:52:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194870 to 192499. [2025-01-08 23:52:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192499 states, 192498 states have (on average 1.0944061756485781) internal successors, (210671), 192498 states have internal predecessors, (210671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192499 states to 192499 states and 210671 transitions. [2025-01-08 23:52:51,334 INFO L78 Accepts]: Start accepts. Automaton has 192499 states and 210671 transitions. Word has length 506 [2025-01-08 23:52:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:51,334 INFO L471 AbstractCegarLoop]: Abstraction has 192499 states and 210671 transitions. [2025-01-08 23:52:51,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 192499 states and 210671 transitions. [2025-01-08 23:52:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-01-08 23:52:51,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:51,345 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:51,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:52:51,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:51,550 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:51,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:51,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1928513217, now seen corresponding path program 1 times [2025-01-08 23:52:51,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:51,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053412452] [2025-01-08 23:52:51,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:51,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:51,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-01-08 23:52:51,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-01-08 23:52:51,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:51,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-01-08 23:52:51,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:51,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053412452] [2025-01-08 23:52:51,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053412452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:51,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:51,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:52:51,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727747637] [2025-01-08 23:52:51,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:51,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:51,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:51,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:51,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:51,723 INFO L87 Difference]: Start difference. First operand 192499 states and 210671 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:54,074 INFO L93 Difference]: Finished difference Result 381831 states and 417605 transitions. [2025-01-08 23:52:54,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:54,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 526 [2025-01-08 23:52:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:54,283 INFO L225 Difference]: With dead ends: 381831 [2025-01-08 23:52:54,284 INFO L226 Difference]: Without dead ends: 190121 [2025-01-08 23:52:54,363 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-01-08 23:52:54,363 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 1665 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:54,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 314 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-08 23:52:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190121 states. [2025-01-08 23:52:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190121 to 190120. [2025-01-08 23:52:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190120 states, 190119 states have (on average 1.0925157401417007) internal successors, (207708), 190119 states have internal predecessors, (207708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190120 states to 190120 states and 207708 transitions. [2025-01-08 23:52:56,479 INFO L78 Accepts]: Start accepts. Automaton has 190120 states and 207708 transitions. Word has length 526 [2025-01-08 23:52:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:56,480 INFO L471 AbstractCegarLoop]: Abstraction has 190120 states and 207708 transitions. [2025-01-08 23:52:56,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 190120 states and 207708 transitions. [2025-01-08 23:52:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2025-01-08 23:52:56,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:56,502 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:56,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:52:56,502 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:56,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1448621392, now seen corresponding path program 1 times [2025-01-08 23:52:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:56,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615154654] [2025-01-08 23:52:56,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:56,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes. [2025-01-08 23:52:56,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements. [2025-01-08 23:52:56,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:56,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 784 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-08 23:52:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:57,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615154654] [2025-01-08 23:52:57,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615154654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:57,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:57,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:57,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090688370] [2025-01-08 23:52:57,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:57,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:57,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:57,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:57,119 INFO L87 Difference]: Start difference. First operand 190120 states and 207708 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)