./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label39.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 e75b25accfa51338058ad16425748718d01a5d94bd667d18c22ba63a9d75c3da --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:11:10,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:11:10,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:11:10,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:11:10,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:11:10,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:11:10,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:11:10,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:11:10,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:11:10,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:11:10,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:11:10,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:11:10,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:11:10,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:11:10,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:11:10,215 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:11:10,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:11:10,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:11:10,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:11:10,216 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 -> e75b25accfa51338058ad16425748718d01a5d94bd667d18c22ba63a9d75c3da [2025-03-16 14:11:10,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:11:10,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:11:10,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:11:10,444 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:11:10,444 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:11:10,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label39.c [2025-03-16 14:11:11,548 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017a4f37e/527b9ae089144c12b26e8dbf419adb5f/FLAGb361f39ac [2025-03-16 14:11:11,861 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:11:11,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label39.c [2025-03-16 14:11:11,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017a4f37e/527b9ae089144c12b26e8dbf419adb5f/FLAGb361f39ac [2025-03-16 14:11:12,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017a4f37e/527b9ae089144c12b26e8dbf419adb5f [2025-03-16 14:11:12,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:11:12,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:11:12,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:12,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:11:12,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:11:12,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d748f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12, skipping insertion in model container [2025-03-16 14:11:12,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:11:12,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label39.c[54057,54070] [2025-03-16 14:11:12,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:12,499 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:11:12,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label39.c[54057,54070] [2025-03-16 14:11:12,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:12,631 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:11:12,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12 WrapperNode [2025-03-16 14:11:12,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:12,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:12,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:11:12,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:11:12,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,725 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-16 14:11:12,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:12,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:11:12,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:11:12,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:11:12,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,778 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:11:12,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,821 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:11:12,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:11:12,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:11:12,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:11:12,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (1/1) ... [2025-03-16 14:11:12,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:11:12,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:12,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:11:12,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:11:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:11:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:11:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:11:12,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:11:12,997 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:11:12,998 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:11:14,235 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 14:11:14,235 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:11:14,245 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:11:14,245 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:11:14,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:14 BoogieIcfgContainer [2025-03-16 14:11:14,246 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:11:14,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:11:14,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:11:14,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:11:14,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:11:12" (1/3) ... [2025-03-16 14:11:14,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acf7c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:14, skipping insertion in model container [2025-03-16 14:11:14,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:12" (2/3) ... [2025-03-16 14:11:14,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acf7c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:14, skipping insertion in model container [2025-03-16 14:11:14,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:14" (3/3) ... [2025-03-16 14:11:14,252 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label39.c [2025-03-16 14:11:14,262 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:11:14,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label39.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:11:14,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:11:14,343 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;@5084a69a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:11:14,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:11:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 14:11:14,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:14,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:14,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:14,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1966297108, now seen corresponding path program 1 times [2025-03-16 14:11:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:14,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823001495] [2025-03-16 14:11:14,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:14,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 14:11:14,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 14:11:14,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:14,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:14,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:14,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823001495] [2025-03-16 14:11:14,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823001495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:14,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:14,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:14,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549641550] [2025-03-16 14:11:14,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:14,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:11:14,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:14,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:11:14,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:11:14,829 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:14,864 INFO L93 Difference]: Finished difference Result 481 states and 913 transitions. [2025-03-16 14:11:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:11:14,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-16 14:11:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:14,875 INFO L225 Difference]: With dead ends: 481 [2025-03-16 14:11:14,875 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 14:11:14,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:11:14,880 INFO L435 NwaCegarLoop]: 395 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, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:14,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:11:14,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 14:11:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-16 14:11:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2025-03-16 14:11:14,935 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 146 [2025-03-16 14:11:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:14,935 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2025-03-16 14:11:14,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2025-03-16 14:11:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 14:11:14,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:14,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:14,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:11:14,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:14,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:14,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1967251381, now seen corresponding path program 1 times [2025-03-16 14:11:14,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:14,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882705649] [2025-03-16 14:11:14,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:14,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:14,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 14:11:15,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 14:11:15,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:15,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:15,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:15,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882705649] [2025-03-16 14:11:15,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882705649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:15,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:15,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:15,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025211250] [2025-03-16 14:11:15,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:15,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:15,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:15,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:15,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:15,336 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:16,073 INFO L93 Difference]: Finished difference Result 704 states and 1166 transitions. [2025-03-16 14:11:16,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:16,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-16 14:11:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:16,075 INFO L225 Difference]: With dead ends: 704 [2025-03-16 14:11:16,076 INFO L226 Difference]: Without dead ends: 467 [2025-03-16 14:11:16,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:16,077 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 98 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:16,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 129 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:16,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-16 14:11:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 453. [2025-03-16 14:11:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.6283185840707965) internal successors, (736), 452 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 736 transitions. [2025-03-16 14:11:16,102 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 736 transitions. Word has length 146 [2025-03-16 14:11:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:16,102 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 736 transitions. [2025-03-16 14:11:16,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 736 transitions. [2025-03-16 14:11:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 14:11:16,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:16,106 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:11:16,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:11:16,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:16,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash -906459149, now seen corresponding path program 1 times [2025-03-16 14:11:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:16,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967629641] [2025-03-16 14:11:16,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:16,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 14:11:16,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 14:11:16,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:16,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:16,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:16,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967629641] [2025-03-16 14:11:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967629641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:16,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24979606] [2025-03-16 14:11:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:16,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:16,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:16,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:16,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:16,383 INFO L87 Difference]: Start difference. First operand 453 states and 736 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:16,594 INFO L93 Difference]: Finished difference Result 1357 states and 2206 transitions. [2025-03-16 14:11:16,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:16,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-03-16 14:11:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:16,598 INFO L225 Difference]: With dead ends: 1357 [2025-03-16 14:11:16,598 INFO L226 Difference]: Without dead ends: 905 [2025-03-16 14:11:16,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:16,599 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:16,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 595 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:11:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-03-16 14:11:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 903. [2025-03-16 14:11:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 902 states have (on average 1.623059866962306) internal successors, (1464), 902 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1464 transitions. [2025-03-16 14:11:16,621 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1464 transitions. Word has length 151 [2025-03-16 14:11:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:16,621 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1464 transitions. [2025-03-16 14:11:16,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1464 transitions. [2025-03-16 14:11:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 14:11:16,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:16,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:16,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:11:16,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:16,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1306399392, now seen corresponding path program 1 times [2025-03-16 14:11:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:16,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467177805] [2025-03-16 14:11:16,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:16,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:16,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 14:11:16,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 14:11:16,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:16,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:16,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:16,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467177805] [2025-03-16 14:11:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467177805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:16,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:16,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203472179] [2025-03-16 14:11:16,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:16,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:16,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:16,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:16,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:16,827 INFO L87 Difference]: Start difference. First operand 903 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:17,506 INFO L93 Difference]: Finished difference Result 2619 states and 4269 transitions. [2025-03-16 14:11:17,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:17,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-03-16 14:11:17,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:17,514 INFO L225 Difference]: With dead ends: 2619 [2025-03-16 14:11:17,514 INFO L226 Difference]: Without dead ends: 1717 [2025-03-16 14:11:17,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:17,516 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 217 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:17,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 197 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2025-03-16 14:11:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1717. [2025-03-16 14:11:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1716 states have (on average 1.4044289044289044) internal successors, (2410), 1716 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2410 transitions. [2025-03-16 14:11:17,571 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2410 transitions. Word has length 152 [2025-03-16 14:11:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:17,571 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 2410 transitions. [2025-03-16 14:11:17,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2410 transitions. [2025-03-16 14:11:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-16 14:11:17,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:17,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:17,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:11:17,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:17,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:17,575 INFO L85 PathProgramCache]: Analyzing trace with hash 710738403, now seen corresponding path program 1 times [2025-03-16 14:11:17,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:17,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959662192] [2025-03-16 14:11:17,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:17,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:17,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-16 14:11:17,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-16 14:11:17,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:17,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:17,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:17,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959662192] [2025-03-16 14:11:17,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959662192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:17,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:17,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:17,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198021290] [2025-03-16 14:11:17,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:17,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:17,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:17,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:17,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:17,701 INFO L87 Difference]: Start difference. First operand 1717 states and 2410 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:18,369 INFO L93 Difference]: Finished difference Result 5088 states and 7162 transitions. [2025-03-16 14:11:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:18,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-16 14:11:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:18,379 INFO L225 Difference]: With dead ends: 5088 [2025-03-16 14:11:18,379 INFO L226 Difference]: Without dead ends: 3372 [2025-03-16 14:11:18,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:18,382 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:18,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2025-03-16 14:11:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3344. [2025-03-16 14:11:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3344 states, 3343 states have (on average 1.3787017648818427) internal successors, (4609), 3343 states have internal predecessors, (4609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 3344 states and 4609 transitions. [2025-03-16 14:11:18,429 INFO L78 Accepts]: Start accepts. Automaton has 3344 states and 4609 transitions. Word has length 154 [2025-03-16 14:11:18,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:18,430 INFO L471 AbstractCegarLoop]: Abstraction has 3344 states and 4609 transitions. [2025-03-16 14:11:18,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 4609 transitions. [2025-03-16 14:11:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-16 14:11:18,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:18,434 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:11:18,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:11:18,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:18,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash -864809683, now seen corresponding path program 1 times [2025-03-16 14:11:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885869577] [2025-03-16 14:11:18,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:18,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:18,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-16 14:11:18,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-16 14:11:18,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:18,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:18,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:18,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885869577] [2025-03-16 14:11:18,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885869577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:18,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:18,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:18,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242933919] [2025-03-16 14:11:18,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:18,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:18,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:18,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:18,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:18,677 INFO L87 Difference]: Start difference. First operand 3344 states and 4609 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:19,359 INFO L93 Difference]: Finished difference Result 9980 states and 13759 transitions. [2025-03-16 14:11:19,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:19,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-03-16 14:11:19,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:19,378 INFO L225 Difference]: With dead ends: 9980 [2025-03-16 14:11:19,378 INFO L226 Difference]: Without dead ends: 6637 [2025-03-16 14:11:19,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:19,384 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 286 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:19,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 97 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2025-03-16 14:11:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6632. [2025-03-16 14:11:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6632 states, 6631 states have (on average 1.352586336902428) internal successors, (8969), 6631 states have internal predecessors, (8969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6632 states to 6632 states and 8969 transitions. [2025-03-16 14:11:19,504 INFO L78 Accepts]: Start accepts. Automaton has 6632 states and 8969 transitions. Word has length 158 [2025-03-16 14:11:19,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:19,504 INFO L471 AbstractCegarLoop]: Abstraction has 6632 states and 8969 transitions. [2025-03-16 14:11:19,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6632 states and 8969 transitions. [2025-03-16 14:11:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 14:11:19,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:19,509 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:19,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:11:19,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:19,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:19,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1563832550, now seen corresponding path program 1 times [2025-03-16 14:11:19,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:19,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047848690] [2025-03-16 14:11:19,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:19,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:19,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 14:11:19,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 14:11:19,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:19,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:19,635 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:19,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:19,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047848690] [2025-03-16 14:11:19,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047848690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:19,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:19,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:19,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278485429] [2025-03-16 14:11:19,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:19,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:19,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:19,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:19,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:19,636 INFO L87 Difference]: Start difference. First operand 6632 states and 8969 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:20,375 INFO L93 Difference]: Finished difference Result 19781 states and 26759 transitions. [2025-03-16 14:11:20,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:20,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 161 [2025-03-16 14:11:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:20,412 INFO L225 Difference]: With dead ends: 19781 [2025-03-16 14:11:20,412 INFO L226 Difference]: Without dead ends: 13150 [2025-03-16 14:11:20,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:20,423 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 118 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:20,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 379 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13150 states. [2025-03-16 14:11:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13150 to 11516. [2025-03-16 14:11:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11516 states, 11515 states have (on average 1.29552757273122) internal successors, (14918), 11515 states have internal predecessors, (14918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11516 states to 11516 states and 14918 transitions. [2025-03-16 14:11:20,607 INFO L78 Accepts]: Start accepts. Automaton has 11516 states and 14918 transitions. Word has length 161 [2025-03-16 14:11:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:20,608 INFO L471 AbstractCegarLoop]: Abstraction has 11516 states and 14918 transitions. [2025-03-16 14:11:20,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 11516 states and 14918 transitions. [2025-03-16 14:11:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 14:11:20,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:20,616 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:20,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:11:20,616 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:20,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1606410608, now seen corresponding path program 1 times [2025-03-16 14:11:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:20,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005316122] [2025-03-16 14:11:20,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:20,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:20,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 14:11:20,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 14:11:20,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:20,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:20,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:20,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005316122] [2025-03-16 14:11:20,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005316122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:20,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:20,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:20,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129557573] [2025-03-16 14:11:20,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:20,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:20,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:20,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:20,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:20,763 INFO L87 Difference]: Start difference. First operand 11516 states and 14918 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:21,467 INFO L93 Difference]: Finished difference Result 28727 states and 38310 transitions. [2025-03-16 14:11:21,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:21,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 167 [2025-03-16 14:11:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:21,502 INFO L225 Difference]: With dead ends: 28727 [2025-03-16 14:11:21,503 INFO L226 Difference]: Without dead ends: 17212 [2025-03-16 14:11:21,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:21,514 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 235 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:21,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 402 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17212 states. [2025-03-16 14:11:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17212 to 15580. [2025-03-16 14:11:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15580 states, 15579 states have (on average 1.254252519417164) internal successors, (19540), 15579 states have internal predecessors, (19540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15580 states to 15580 states and 19540 transitions. [2025-03-16 14:11:21,727 INFO L78 Accepts]: Start accepts. Automaton has 15580 states and 19540 transitions. Word has length 167 [2025-03-16 14:11:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:21,727 INFO L471 AbstractCegarLoop]: Abstraction has 15580 states and 19540 transitions. [2025-03-16 14:11:21,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 15580 states and 19540 transitions. [2025-03-16 14:11:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-16 14:11:21,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:21,743 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:21,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:11:21,744 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:21,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1761329292, now seen corresponding path program 1 times [2025-03-16 14:11:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868385508] [2025-03-16 14:11:21,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:21,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-16 14:11:21,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-16 14:11:21,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:21,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:11:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868385508] [2025-03-16 14:11:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868385508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:22,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25671420] [2025-03-16 14:11:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:22,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:11:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:22,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:11:22,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:22,006 INFO L87 Difference]: Start difference. First operand 15580 states and 19540 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:22,866 INFO L93 Difference]: Finished difference Result 42079 states and 52493 transitions. [2025-03-16 14:11:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:11:22,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 240 [2025-03-16 14:11:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:22,913 INFO L225 Difference]: With dead ends: 42079 [2025-03-16 14:11:22,913 INFO L226 Difference]: Without dead ends: 26500 [2025-03-16 14:11:22,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:22,936 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 545 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:22,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 55 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26500 states. [2025-03-16 14:11:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26500 to 26496. [2025-03-16 14:11:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26496 states, 26495 states have (on average 1.1804868843177958) internal successors, (31277), 26495 states have internal predecessors, (31277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26496 states to 26496 states and 31277 transitions. [2025-03-16 14:11:23,387 INFO L78 Accepts]: Start accepts. Automaton has 26496 states and 31277 transitions. Word has length 240 [2025-03-16 14:11:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:23,388 INFO L471 AbstractCegarLoop]: Abstraction has 26496 states and 31277 transitions. [2025-03-16 14:11:23,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 26496 states and 31277 transitions. [2025-03-16 14:11:23,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-16 14:11:23,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:23,400 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:23,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:11:23,400 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:23,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1147910304, now seen corresponding path program 1 times [2025-03-16 14:11:23,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:23,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087710921] [2025-03-16 14:11:23,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:23,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-16 14:11:23,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-16 14:11:23,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:23,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:23,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:23,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087710921] [2025-03-16 14:11:23,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087710921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:23,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461004715] [2025-03-16 14:11:23,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:23,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:23,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:23,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:23,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:11:23,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-16 14:11:23,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-16 14:11:23,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:23,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:23,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:23,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-16 14:11:24,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461004715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:24,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:24,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:11:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449153002] [2025-03-16 14:11:24,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:24,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:24,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:24,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:24,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:24,109 INFO L87 Difference]: Start difference. First operand 26496 states and 31277 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:24,787 INFO L93 Difference]: Finished difference Result 52995 states and 62561 transitions. [2025-03-16 14:11:24,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:24,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 248 [2025-03-16 14:11:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:24,828 INFO L225 Difference]: With dead ends: 52995 [2025-03-16 14:11:24,828 INFO L226 Difference]: Without dead ends: 26500 [2025-03-16 14:11:24,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:24,844 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 109 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:24,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 108 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26500 states. [2025-03-16 14:11:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26500 to 24462. [2025-03-16 14:11:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24462 states, 24461 states have (on average 1.149912104983443) internal successors, (28128), 24461 states have internal predecessors, (28128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24462 states to 24462 states and 28128 transitions. [2025-03-16 14:11:25,210 INFO L78 Accepts]: Start accepts. Automaton has 24462 states and 28128 transitions. Word has length 248 [2025-03-16 14:11:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:25,211 INFO L471 AbstractCegarLoop]: Abstraction has 24462 states and 28128 transitions. [2025-03-16 14:11:25,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 24462 states and 28128 transitions. [2025-03-16 14:11:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 14:11:25,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:25,227 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:25,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:11:25,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 14:11:25,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:25,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:25,433 INFO L85 PathProgramCache]: Analyzing trace with hash -208302002, now seen corresponding path program 1 times [2025-03-16 14:11:25,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:25,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682934506] [2025-03-16 14:11:25,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:25,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:25,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 14:11:25,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 14:11:25,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:25,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:25,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:25,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682934506] [2025-03-16 14:11:25,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682934506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:25,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:25,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:25,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393186341] [2025-03-16 14:11:25,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:25,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:25,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:25,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:25,610 INFO L87 Difference]: Start difference. First operand 24462 states and 28128 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:26,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:26,372 INFO L93 Difference]: Finished difference Result 65983 states and 75644 transitions. [2025-03-16 14:11:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:26,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-03-16 14:11:26,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:26,424 INFO L225 Difference]: With dead ends: 65983 [2025-03-16 14:11:26,424 INFO L226 Difference]: Without dead ends: 41522 [2025-03-16 14:11:26,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:26,449 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 245 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:26,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 331 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41522 states. [2025-03-16 14:11:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41522 to 39488. [2025-03-16 14:11:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39488 states, 39487 states have (on average 1.1194317117025856) internal successors, (44203), 39487 states have internal predecessors, (44203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39488 states to 39488 states and 44203 transitions. [2025-03-16 14:11:26,992 INFO L78 Accepts]: Start accepts. Automaton has 39488 states and 44203 transitions. Word has length 256 [2025-03-16 14:11:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:26,992 INFO L471 AbstractCegarLoop]: Abstraction has 39488 states and 44203 transitions. [2025-03-16 14:11:26,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 39488 states and 44203 transitions. [2025-03-16 14:11:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-16 14:11:27,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:27,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:27,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:11:27,007 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:27,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1621021879, now seen corresponding path program 1 times [2025-03-16 14:11:27,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:27,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69258555] [2025-03-16 14:11:27,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:27,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:27,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-16 14:11:27,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-16 14:11:27,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:27,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:27,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:27,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69258555] [2025-03-16 14:11:27,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69258555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:27,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:27,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072329563] [2025-03-16 14:11:27,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:27,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:27,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:27,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:27,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:27,317 INFO L87 Difference]: Start difference. First operand 39488 states and 44203 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:27,955 INFO L93 Difference]: Finished difference Result 77769 states and 87119 transitions. [2025-03-16 14:11:27,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:27,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 276 [2025-03-16 14:11:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:28,003 INFO L225 Difference]: With dead ends: 77769 [2025-03-16 14:11:28,003 INFO L226 Difference]: Without dead ends: 38282 [2025-03-16 14:11:28,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:28,036 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 117 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:28,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 289 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38282 states. [2025-03-16 14:11:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38282 to 35428. [2025-03-16 14:11:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35428 states, 35427 states have (on average 1.1104807068055438) internal successors, (39341), 35427 states have internal predecessors, (39341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35428 states to 35428 states and 39341 transitions. [2025-03-16 14:11:28,537 INFO L78 Accepts]: Start accepts. Automaton has 35428 states and 39341 transitions. Word has length 276 [2025-03-16 14:11:28,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:28,538 INFO L471 AbstractCegarLoop]: Abstraction has 35428 states and 39341 transitions. [2025-03-16 14:11:28,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 35428 states and 39341 transitions. [2025-03-16 14:11:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-16 14:11:28,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:28,554 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:28,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:11:28,554 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:28,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:28,555 INFO L85 PathProgramCache]: Analyzing trace with hash -978795673, now seen corresponding path program 1 times [2025-03-16 14:11:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:28,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460411912] [2025-03-16 14:11:28,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:28,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:28,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-16 14:11:28,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-16 14:11:28,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:28,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:28,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:28,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460411912] [2025-03-16 14:11:28,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460411912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:28,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:28,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:28,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797429238] [2025-03-16 14:11:28,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:28,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:28,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:28,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:28,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:28,887 INFO L87 Difference]: Start difference. First operand 35428 states and 39341 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:29,586 INFO L93 Difference]: Finished difference Result 79409 states and 88151 transitions. [2025-03-16 14:11:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:29,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 297 [2025-03-16 14:11:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:29,633 INFO L225 Difference]: With dead ends: 79409 [2025-03-16 14:11:29,633 INFO L226 Difference]: Without dead ends: 43982 [2025-03-16 14:11:29,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:29,656 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 88 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:29,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 342 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43982 states. [2025-03-16 14:11:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43982 to 40300. [2025-03-16 14:11:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40300 states, 40299 states have (on average 1.1053127869177894) internal successors, (44543), 40299 states have internal predecessors, (44543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40300 states to 40300 states and 44543 transitions. [2025-03-16 14:11:30,207 INFO L78 Accepts]: Start accepts. Automaton has 40300 states and 44543 transitions. Word has length 297 [2025-03-16 14:11:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:30,207 INFO L471 AbstractCegarLoop]: Abstraction has 40300 states and 44543 transitions. [2025-03-16 14:11:30,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 40300 states and 44543 transitions. [2025-03-16 14:11:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-16 14:11:30,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:30,222 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:30,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:11:30,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:30,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:30,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1672340919, now seen corresponding path program 1 times [2025-03-16 14:11:30,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:30,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118169095] [2025-03-16 14:11:30,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:30,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:30,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-16 14:11:30,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-16 14:11:30,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:30,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:30,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:30,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118169095] [2025-03-16 14:11:30,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118169095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:30,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:30,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12575090] [2025-03-16 14:11:30,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:30,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:11:30,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:30,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:11:30,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:30,550 INFO L87 Difference]: Start difference. First operand 40300 states and 44543 transitions. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:31,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:31,419 INFO L93 Difference]: Finished difference Result 86327 states and 95537 transitions. [2025-03-16 14:11:31,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:11:31,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 313 [2025-03-16 14:11:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:31,475 INFO L225 Difference]: With dead ends: 86327 [2025-03-16 14:11:31,475 INFO L226 Difference]: Without dead ends: 46028 [2025-03-16 14:11:31,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:31,506 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 275 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:31,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 85 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46028 states. [2025-03-16 14:11:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46028 to 40300. [2025-03-16 14:11:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40300 states, 40299 states have (on average 1.1053127869177894) internal successors, (44543), 40299 states have internal predecessors, (44543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40300 states to 40300 states and 44543 transitions. [2025-03-16 14:11:31,985 INFO L78 Accepts]: Start accepts. Automaton has 40300 states and 44543 transitions. Word has length 313 [2025-03-16 14:11:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:31,985 INFO L471 AbstractCegarLoop]: Abstraction has 40300 states and 44543 transitions. [2025-03-16 14:11:31,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 40300 states and 44543 transitions. [2025-03-16 14:11:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-16 14:11:32,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:32,001 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:32,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:11:32,001 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:32,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1796785748, now seen corresponding path program 1 times [2025-03-16 14:11:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:32,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176485750] [2025-03-16 14:11:32,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:32,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:32,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-16 14:11:32,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-16 14:11:32,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:32,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-16 14:11:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:32,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176485750] [2025-03-16 14:11:32,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176485750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:32,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109557776] [2025-03-16 14:11:32,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:32,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:32,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:32,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:32,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:11:32,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-16 14:11:33,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-16 14:11:33,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:33,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:33,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:33,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 14:11:33,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:33,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109557776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:33,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:33,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:11:33,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529051175] [2025-03-16 14:11:33,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:33,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:33,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:33,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:33,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:33,185 INFO L87 Difference]: Start difference. First operand 40300 states and 44543 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:33,758 INFO L93 Difference]: Finished difference Result 83879 states and 92796 transitions. [2025-03-16 14:11:33,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:33,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 320 [2025-03-16 14:11:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:33,804 INFO L225 Difference]: With dead ends: 83879 [2025-03-16 14:11:33,805 INFO L226 Difference]: Without dead ends: 43580 [2025-03-16 14:11:33,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:11:33,834 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 77 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:33,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 362 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:11:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43580 states. [2025-03-16 14:11:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43580 to 41112. [2025-03-16 14:11:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41112 states, 41111 states have (on average 1.1022110870569921) internal successors, (45313), 41111 states have internal predecessors, (45313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41112 states to 41112 states and 45313 transitions. [2025-03-16 14:11:34,293 INFO L78 Accepts]: Start accepts. Automaton has 41112 states and 45313 transitions. Word has length 320 [2025-03-16 14:11:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:34,293 INFO L471 AbstractCegarLoop]: Abstraction has 41112 states and 45313 transitions. [2025-03-16 14:11:34,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 41112 states and 45313 transitions. [2025-03-16 14:11:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-16 14:11:34,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:34,310 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:34,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:11:34,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 14:11:34,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:34,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:34,511 INFO L85 PathProgramCache]: Analyzing trace with hash -408106320, now seen corresponding path program 1 times [2025-03-16 14:11:34,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:34,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333646468] [2025-03-16 14:11:34,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:34,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:34,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-16 14:11:34,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-16 14:11:34,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:34,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-16 14:11:34,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:34,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333646468] [2025-03-16 14:11:34,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333646468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:34,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:34,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721765889] [2025-03-16 14:11:34,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:34,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:34,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:34,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:34,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:34,708 INFO L87 Difference]: Start difference. First operand 41112 states and 45313 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:35,317 INFO L93 Difference]: Finished difference Result 102999 states and 113764 transitions. [2025-03-16 14:11:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:35,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 376 [2025-03-16 14:11:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:35,384 INFO L225 Difference]: With dead ends: 102999 [2025-03-16 14:11:35,384 INFO L226 Difference]: Without dead ends: 61888 [2025-03-16 14:11:35,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:35,418 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 206 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:35,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 101 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:11:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61888 states. [2025-03-16 14:11:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61888 to 61066. [2025-03-16 14:11:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61066 states, 61065 states have (on average 1.1058871694096455) internal successors, (67531), 61065 states have internal predecessors, (67531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61066 states to 61066 states and 67531 transitions. [2025-03-16 14:11:36,185 INFO L78 Accepts]: Start accepts. Automaton has 61066 states and 67531 transitions. Word has length 376 [2025-03-16 14:11:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:36,186 INFO L471 AbstractCegarLoop]: Abstraction has 61066 states and 67531 transitions. [2025-03-16 14:11:36,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 61066 states and 67531 transitions. [2025-03-16 14:11:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-16 14:11:36,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:36,223 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:36,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:11:36,223 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:36,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1750413, now seen corresponding path program 1 times [2025-03-16 14:11:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:36,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760969734] [2025-03-16 14:11:36,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:36,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:36,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-16 14:11:36,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-16 14:11:36,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:36,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 156 proven. 6 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-16 14:11:36,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760969734] [2025-03-16 14:11:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760969734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736838516] [2025-03-16 14:11:36,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:36,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:36,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:36,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:36,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:11:36,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-16 14:11:36,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-16 14:11:36,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:36,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:36,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:36,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-16 14:11:37,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:37,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736838516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:37,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:37,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:11:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784902014] [2025-03-16 14:11:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:37,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:37,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:37,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:37,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:37,077 INFO L87 Difference]: Start difference. First operand 61066 states and 67531 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:37,626 INFO L93 Difference]: Finished difference Result 173241 states and 191421 transitions. [2025-03-16 14:11:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:37,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 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 383 [2025-03-16 14:11:37,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:37,782 INFO L225 Difference]: With dead ends: 173241 [2025-03-16 14:11:37,782 INFO L226 Difference]: Without dead ends: 112176 [2025-03-16 14:11:37,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:37,839 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 206 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:37,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 548 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:11:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112176 states. [2025-03-16 14:11:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112176 to 112174. [2025-03-16 14:11:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112174 states, 112173 states have (on average 1.1038752641009868) internal successors, (123825), 112173 states have internal predecessors, (123825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112174 states to 112174 states and 123825 transitions. [2025-03-16 14:11:39,569 INFO L78 Accepts]: Start accepts. Automaton has 112174 states and 123825 transitions. Word has length 383 [2025-03-16 14:11:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:39,570 INFO L471 AbstractCegarLoop]: Abstraction has 112174 states and 123825 transitions. [2025-03-16 14:11:39,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 112174 states and 123825 transitions. [2025-03-16 14:11:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-16 14:11:39,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:39,857 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:39,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:11:40,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:40,058 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:40,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash 570163497, now seen corresponding path program 1 times [2025-03-16 14:11:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804957416] [2025-03-16 14:11:40,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:40,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:40,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-16 14:11:40,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-16 14:11:40,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:40,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-03-16 14:11:40,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:40,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804957416] [2025-03-16 14:11:40,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804957416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:40,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:40,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:40,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509864781] [2025-03-16 14:11:40,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:40,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:11:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:40,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:11:40,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:40,370 INFO L87 Difference]: Start difference. First operand 112174 states and 123825 transitions. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:41,487 INFO L93 Difference]: Finished difference Result 235409 states and 260005 transitions. [2025-03-16 14:11:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:11:41,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.25) 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 408 [2025-03-16 14:11:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:41,640 INFO L225 Difference]: With dead ends: 235409 [2025-03-16 14:11:41,640 INFO L226 Difference]: Without dead ends: 123236 [2025-03-16 14:11:41,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:41,719 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 350 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:41,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 95 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:41,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123236 states. [2025-03-16 14:11:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123236 to 116640. [2025-03-16 14:11:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116640 states, 116639 states have (on average 1.0831454316309297) internal successors, (126337), 116639 states have internal predecessors, (126337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116640 states to 116640 states and 126337 transitions. [2025-03-16 14:11:43,373 INFO L78 Accepts]: Start accepts. Automaton has 116640 states and 126337 transitions. Word has length 408 [2025-03-16 14:11:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:43,373 INFO L471 AbstractCegarLoop]: Abstraction has 116640 states and 126337 transitions. [2025-03-16 14:11:43,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 116640 states and 126337 transitions. [2025-03-16 14:11:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-16 14:11:43,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:43,408 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:11:43,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:11:43,408 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:43,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:43,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1650282631, now seen corresponding path program 1 times [2025-03-16 14:11:43,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:43,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773064426] [2025-03-16 14:11:43,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:43,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:43,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-16 14:11:43,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-16 14:11:43,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:43,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 379 proven. 124 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-16 14:11:44,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773064426] [2025-03-16 14:11:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773064426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910277742] [2025-03-16 14:11:44,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:44,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:44,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:44,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:44,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:11:44,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-16 14:11:44,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-16 14:11:44,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:44,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:44,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:11:44,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 410 proven. 30 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-16 14:11:44,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:11:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 410 proven. 30 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-16 14:11:44,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910277742] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:11:44,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:11:44,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-16 14:11:44,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734613340] [2025-03-16 14:11:44,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:11:44,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:11:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:44,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:11:44,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:11:44,731 INFO L87 Difference]: Start difference. First operand 116640 states and 126337 transitions. Second operand has 7 states, 7 states have (on average 85.57142857142857) internal successors, (599), 7 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:48,082 INFO L93 Difference]: Finished difference Result 448506 states and 486629 transitions. [2025-03-16 14:11:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 14:11:48,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 85.57142857142857) internal successors, (599), 7 states have internal predecessors, (599), 0 states have call successors, (0), 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-03-16 14:11:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:48,482 INFO L225 Difference]: With dead ends: 448506 [2025-03-16 14:11:48,482 INFO L226 Difference]: Without dead ends: 331867 [2025-03-16 14:11:48,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:11:48,767 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 3305 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 1032 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3305 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 3904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1032 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:48,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3305 Valid, 175 Invalid, 3904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1032 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:11:48,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331867 states. [2025-03-16 14:11:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331867 to 322887. [2025-03-16 14:11:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322887 states, 322886 states have (on average 1.0822705227231901) internal successors, (349450), 322886 states have internal predecessors, (349450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322887 states to 322887 states and 349450 transitions. [2025-03-16 14:11:53,031 INFO L78 Accepts]: Start accepts. Automaton has 322887 states and 349450 transitions. Word has length 435 [2025-03-16 14:11:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:53,031 INFO L471 AbstractCegarLoop]: Abstraction has 322887 states and 349450 transitions. [2025-03-16 14:11:53,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.57142857142857) internal successors, (599), 7 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 322887 states and 349450 transitions. [2025-03-16 14:11:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-16 14:11:53,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:53,065 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:53,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 14:11:53,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:53,266 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:53,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:53,266 INFO L85 PathProgramCache]: Analyzing trace with hash -680974940, now seen corresponding path program 1 times [2025-03-16 14:11:53,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:53,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805611822] [2025-03-16 14:11:53,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:53,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:53,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-16 14:11:53,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-16 14:11:53,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:53,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2025-03-16 14:11:53,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:53,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805611822] [2025-03-16 14:11:53,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805611822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:11:53,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721711885] [2025-03-16 14:11:53,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:53,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:11:53,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:53,849 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:11:53,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:11:53,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-16 14:11:54,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-16 14:11:54,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:54,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:54,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:11:54,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:11:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 549 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-03-16 14:11:54,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:11:54,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721711885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:54,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:11:54,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:11:54,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227596423] [2025-03-16 14:11:54,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:54,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:54,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:54,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:54,207 INFO L87 Difference]: Start difference. First operand 322887 states and 349450 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:56,156 INFO L93 Difference]: Finished difference Result 631195 states and 683340 transitions. [2025-03-16 14:11:56,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:56,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 443 [2025-03-16 14:11:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:56,571 INFO L225 Difference]: With dead ends: 631195 [2025-03-16 14:11:56,572 INFO L226 Difference]: Without dead ends: 308309 [2025-03-16 14:11:56,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:11:56,692 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 130 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:56,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 117 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:11:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308309 states. [2025-03-16 14:12:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308309 to 298071. [2025-03-16 14:12:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298071 states, 298070 states have (on average 1.0721944509678933) internal successors, (319589), 298070 states have internal predecessors, (319589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298071 states to 298071 states and 319589 transitions. [2025-03-16 14:12:01,059 INFO L78 Accepts]: Start accepts. Automaton has 298071 states and 319589 transitions. Word has length 443 [2025-03-16 14:12:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:01,060 INFO L471 AbstractCegarLoop]: Abstraction has 298071 states and 319589 transitions. [2025-03-16 14:12:01,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 298071 states and 319589 transitions. [2025-03-16 14:12:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-16 14:12:01,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:01,090 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:12:01,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 14:12:01,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:01,290 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:01,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 260865955, now seen corresponding path program 1 times [2025-03-16 14:12:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:01,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180569246] [2025-03-16 14:12:01,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:01,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-16 14:12:01,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-16 14:12:01,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:01,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 120 proven. 6 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-16 14:12:01,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180569246] [2025-03-16 14:12:01,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180569246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633258104] [2025-03-16 14:12:01,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:01,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:01,889 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:01,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 14:12:01,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-16 14:12:02,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-16 14:12:02,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:02,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:02,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:02,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-16 14:12:02,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:02,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633258104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:02,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:02,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:02,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490914458] [2025-03-16 14:12:02,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:02,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:02,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:02,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:02,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:02,171 INFO L87 Difference]: Start difference. First operand 298071 states and 319589 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:03,422 INFO L93 Difference]: Finished difference Result 434451 states and 464222 transitions. [2025-03-16 14:12:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:03,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 446 [2025-03-16 14:12:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:03,585 INFO L225 Difference]: With dead ends: 434451 [2025-03-16 14:12:03,585 INFO L226 Difference]: Without dead ends: 127853 [2025-03-16 14:12:03,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:03,710 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 116 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:03,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 99 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127853 states. [2025-03-16 14:12:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127853 to 109338. [2025-03-16 14:12:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109338 states, 109337 states have (on average 1.0484008158262985) internal successors, (114629), 109337 states have internal predecessors, (114629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109338 states to 109338 states and 114629 transitions. [2025-03-16 14:12:05,790 INFO L78 Accepts]: Start accepts. Automaton has 109338 states and 114629 transitions. Word has length 446 [2025-03-16 14:12:05,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:05,791 INFO L471 AbstractCegarLoop]: Abstraction has 109338 states and 114629 transitions. [2025-03-16 14:12:05,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 109338 states and 114629 transitions. [2025-03-16 14:12:05,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-16 14:12:05,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:05,816 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:12:05,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 14:12:06,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:06,017 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:06,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash 548014964, now seen corresponding path program 1 times [2025-03-16 14:12:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:06,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430945324] [2025-03-16 14:12:06,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:06,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:06,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-16 14:12:06,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-16 14:12:06,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:06,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-16 14:12:06,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:06,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430945324] [2025-03-16 14:12:06,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430945324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:06,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:06,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:06,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12325535] [2025-03-16 14:12:06,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:06,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:06,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:06,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:06,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:06,218 INFO L87 Difference]: Start difference. First operand 109338 states and 114629 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:07,205 INFO L93 Difference]: Finished difference Result 221585 states and 232473 transitions. [2025-03-16 14:12:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 475 [2025-03-16 14:12:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:07,336 INFO L225 Difference]: With dead ends: 221585 [2025-03-16 14:12:07,336 INFO L226 Difference]: Without dead ends: 112248 [2025-03-16 14:12:07,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:07,407 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:07,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 333 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112248 states.