./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/dijkstra-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench/dijkstra-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b586a178399b4c0df2fdcb66faa06566663e0a18b90a5f0ce0551810014ff769 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:41:44,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:41:44,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:41:44,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:41:44,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:41:44,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:41:44,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:41:44,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:41:44,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:41:44,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:41:44,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:41:44,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:41:44,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:41:44,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:41:44,275 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:41:44,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:41:44,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:41:44,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:41:44,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:41:44,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:41:44,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:41:44,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:41:44,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:41:44,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:41:44,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:41:44,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:41:44,277 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b586a178399b4c0df2fdcb66faa06566663e0a18b90a5f0ce0551810014ff769 [2025-03-03 13:41:44,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:41:44,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:41:44,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:41:44,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:41:44,535 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:41:44,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/dijkstra-u.c [2025-03-03 13:41:45,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de5e1cd18/0ee75c2e518848afbc61a6ff0452cc3a/FLAG9d4fd701c [2025-03-03 13:41:45,901 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:41:45,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/dijkstra-u.c [2025-03-03 13:41:45,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de5e1cd18/0ee75c2e518848afbc61a6ff0452cc3a/FLAG9d4fd701c [2025-03-03 13:41:45,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de5e1cd18/0ee75c2e518848afbc61a6ff0452cc3a [2025-03-03 13:41:45,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:41:45,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:41:45,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:41:45,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:41:45,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:41:45,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:41:45" (1/1) ... [2025-03-03 13:41:45,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2153345e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:45, skipping insertion in model container [2025-03-03 13:41:45,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:41:45" (1/1) ... [2025-03-03 13:41:45,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:41:46,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/dijkstra-u.c[525,538] [2025-03-03 13:41:46,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:41:46,115 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:41:46,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/dijkstra-u.c[525,538] [2025-03-03 13:41:46,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:41:46,151 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:41:46,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46 WrapperNode [2025-03-03 13:41:46,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:41:46,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:41:46,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:41:46,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:41:46,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,175 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-03-03 13:41:46,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:41:46,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:41:46,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:41:46,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:41:46,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,192 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:41:46,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:41:46,197 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:41:46,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:41:46,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:41:46,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (1/1) ... [2025-03-03 13:41:46,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:41:46,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:46,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:41:46,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:41:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:41:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:41:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:41:46,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:41:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:41:46,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:41:46,277 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:41:46,278 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:41:46,420 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-03 13:41:46,420 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:41:46,427 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:41:46,427 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:41:46,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:41:46 BoogieIcfgContainer [2025-03-03 13:41:46,428 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:41:46,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:41:46,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:41:46,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:41:46,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:41:45" (1/3) ... [2025-03-03 13:41:46,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721cbcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:41:46, skipping insertion in model container [2025-03-03 13:41:46,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:41:46" (2/3) ... [2025-03-03 13:41:46,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721cbcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:41:46, skipping insertion in model container [2025-03-03 13:41:46,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:41:46" (3/3) ... [2025-03-03 13:41:46,436 INFO L128 eAbstractionObserver]: Analyzing ICFG dijkstra-u.c [2025-03-03 13:41:46,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:41:46,449 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dijkstra-u.c that has 2 procedures, 26 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 13:41:46,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:41:46,500 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;@37d8771f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:41:46,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:41:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 13:41:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:41:46,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:46,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:46,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:46,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:46,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1965516290, now seen corresponding path program 1 times [2025-03-03 13:41:46,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:46,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175835492] [2025-03-03 13:41:46,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:41:46,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:46,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:41:46,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:41:46,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:41:46,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:41:46,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:46,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175835492] [2025-03-03 13:41:46,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175835492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:41:46,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:41:46,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:41:46,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244359667] [2025-03-03 13:41:46,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:41:46,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:41:46,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:46,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:41:46,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:41:46,611 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:46,625 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2025-03-03 13:41:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:41:46,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 13:41:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:46,631 INFO L225 Difference]: With dead ends: 49 [2025-03-03 13:41:46,631 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 13:41:46,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:41:46,637 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:46,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:41:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 13:41:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 13:41:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:41:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2025-03-03 13:41:46,669 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 9 [2025-03-03 13:41:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:46,669 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2025-03-03 13:41:46,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2025-03-03 13:41:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:41:46,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:46,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:46,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:41:46,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:46,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1441947325, now seen corresponding path program 1 times [2025-03-03 13:41:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:46,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582933958] [2025-03-03 13:41:46,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:41:46,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:46,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:41:46,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:41:46,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:41:46,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:41:47,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:47,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582933958] [2025-03-03 13:41:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582933958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:41:47,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:41:47,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:41:47,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323563341] [2025-03-03 13:41:47,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:41:47,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:41:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:47,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:41:47,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:41:47,057 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:48,212 INFO L93 Difference]: Finished difference Result 51 states and 78 transitions. [2025-03-03 13:41:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:41:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 13:41:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:48,214 INFO L225 Difference]: With dead ends: 51 [2025-03-03 13:41:48,214 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 13:41:48,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:41:48,215 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:48,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 140 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 13:41:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 13:41:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-03 13:41:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 13:41:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2025-03-03 13:41:48,226 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 9 [2025-03-03 13:41:48,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:48,226 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2025-03-03 13:41:48,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2025-03-03 13:41:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 13:41:48,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:48,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:48,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:41:48,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:48,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:48,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1722450263, now seen corresponding path program 1 times [2025-03-03 13:41:48,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:48,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364110548] [2025-03-03 13:41:48,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:41:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:48,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 13:41:48,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 13:41:48,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:41:48,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:41:48,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:48,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364110548] [2025-03-03 13:41:48,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364110548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:41:48,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:41:48,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:41:48,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961668370] [2025-03-03 13:41:48,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:41:48,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:41:48,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:48,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:41:48,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:41:48,458 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:48,943 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2025-03-03 13:41:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:41:48,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 13:41:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:48,947 INFO L225 Difference]: With dead ends: 58 [2025-03-03 13:41:48,947 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 13:41:48,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:41:48,948 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:48,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 99 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:41:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 13:41:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2025-03-03 13:41:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 13:41:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2025-03-03 13:41:48,957 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 10 [2025-03-03 13:41:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:48,958 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2025-03-03 13:41:48,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2025-03-03 13:41:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:41:48,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:48,958 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:48,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:41:48,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:48,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash 56584766, now seen corresponding path program 1 times [2025-03-03 13:41:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:48,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708253905] [2025-03-03 13:41:48,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:41:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:48,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:41:48,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:41:48,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:41:48,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:41:48,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544662852] [2025-03-03 13:41:48,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:41:48,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:48,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:48,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:48,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:41:49,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:41:49,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:41:49,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:41:49,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:49,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:41:49,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:41:49,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:41:49,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:49,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708253905] [2025-03-03 13:41:49,080 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:41:49,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544662852] [2025-03-03 13:41:49,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544662852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:41:49,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:41:49,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:41:49,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923048141] [2025-03-03 13:41:49,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:41:49,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:41:49,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:49,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:41:49,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:41:49,081 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:41:49,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:49,175 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2025-03-03 13:41:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:41:49,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-03 13:41:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:49,177 INFO L225 Difference]: With dead ends: 45 [2025-03-03 13:41:49,177 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 13:41:49,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:41:49,178 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:49,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 89 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:41:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 13:41:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-03 13:41:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 13:41:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2025-03-03 13:41:49,192 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 14 [2025-03-03 13:41:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:49,192 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2025-03-03 13:41:49,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:41:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2025-03-03 13:41:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:41:49,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:49,193 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:49,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:41:49,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:49,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:49,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1434975384, now seen corresponding path program 1 times [2025-03-03 13:41:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:49,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596864516] [2025-03-03 13:41:49,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:41:49,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:49,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:41:49,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:41:49,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:41:49,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:41:49,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463999086] [2025-03-03 13:41:49,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:41:49,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:49,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:49,412 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:49,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:41:49,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:41:49,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:41:49,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:41:49,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:49,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:41:49,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:41:49,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:41:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:49,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596864516] [2025-03-03 13:41:49,681 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:41:49,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463999086] [2025-03-03 13:41:49,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463999086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:49,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:41:49,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-03 13:41:49,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199024247] [2025-03-03 13:41:49,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:49,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:41:49,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:49,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:41:49,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:41:49,683 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:41:53,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:41:55,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:00,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:05,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:09,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:10,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:14,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:19,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:23,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:27,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:31,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:35,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:42:35,059 INFO L93 Difference]: Finished difference Result 99 states and 157 transitions. [2025-03-03 13:42:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:42:35,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-03-03 13:42:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:42:35,060 INFO L225 Difference]: With dead ends: 99 [2025-03-03 13:42:35,060 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 13:42:35,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:42:35,060 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 26 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:42:35,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 177 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 127 Invalid, 10 Unknown, 0 Unchecked, 45.3s Time] [2025-03-03 13:42:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 13:42:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2025-03-03 13:42:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 30 states have (on average 1.3) internal successors, (39), 34 states have internal predecessors, (39), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 13:42:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-03-03 13:42:35,083 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 15 [2025-03-03 13:42:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:42:35,083 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-03-03 13:42:35,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:42:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-03-03 13:42:35,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:42:35,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:42:35,084 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:42:35,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:42:35,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:42:35,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:42:35,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:42:35,289 INFO L85 PathProgramCache]: Analyzing trace with hash -904008093, now seen corresponding path program 1 times [2025-03-03 13:42:35,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:42:35,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566526582] [2025-03-03 13:42:35,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:42:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:42:35,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:42:35,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:42:35,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:42:35,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:42:35,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [813190468] [2025-03-03 13:42:35,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:42:35,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:42:35,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:42:35,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:42:35,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:42:35,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:42:35,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:42:35,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:42:35,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:42:35,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:42:35,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:42:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:42:35,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:42:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:42:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566526582] [2025-03-03 13:42:35,373 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:42:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813190468] [2025-03-03 13:42:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813190468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:42:35,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:42:35,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:42:35,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339754613] [2025-03-03 13:42:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:42:35,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:42:35,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:42:35,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:42:35,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:42:35,374 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:42:37,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:42:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:42:37,143 INFO L93 Difference]: Finished difference Result 94 states and 135 transitions. [2025-03-03 13:42:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:42:37,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-03 13:42:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:42:37,144 INFO L225 Difference]: With dead ends: 94 [2025-03-03 13:42:37,144 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 13:42:37,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:42:37,145 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:42:37,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 13:42:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 13:42:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-03 13:42:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 13:42:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-03-03 13:42:37,166 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 19 [2025-03-03 13:42:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:42:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-03-03 13:42:37,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:42:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-03-03 13:42:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:42:37,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:42:37,167 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:42:37,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:42:37,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:42:37,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:42:37,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:42:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1843515202, now seen corresponding path program 2 times [2025-03-03 13:42:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:42:37,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918665297] [2025-03-03 13:42:37,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:42:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:42:37,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-03 13:42:37,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:42:37,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:42:37,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:42:37,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913865157] [2025-03-03 13:42:37,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:42:37,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:42:37,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:42:37,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:42:37,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:42:37,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-03 13:42:37,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:42:37,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:42:37,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:42:37,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 13:42:37,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:42:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:42:37,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:43:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:43:01,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:43:01,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918665297] [2025-03-03 13:43:01,352 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:43:01,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913865157] [2025-03-03 13:43:01,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913865157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:43:01,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:43:01,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-03-03 13:43:01,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76312647] [2025-03-03 13:43:01,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:43:01,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 13:43:01,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:43:01,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 13:43:01,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=328, Unknown=2, NotChecked=0, Total=420 [2025-03-03 13:43:01,354 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 21 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)