./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label51.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/Problem14_label51.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 b9188b0bb7d345bde8858a6e4085c80a345a783efac7d50b39494fde4a7e156f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:06:58,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:06:58,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:06:58,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:06:58,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:06:58,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:06:58,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:06:58,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:06:58,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:06:58,827 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:06:58,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:06:58,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:06:58,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:06:58,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:06:58,828 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:06:58,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:06:58,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:06:58,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:58,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:06:58,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:06:58,831 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 -> b9188b0bb7d345bde8858a6e4085c80a345a783efac7d50b39494fde4a7e156f [2025-03-16 15:06:59,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:06:59,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:06:59,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:06:59,092 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:06:59,093 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:06:59,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label51.c [2025-03-16 15:07:00,276 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5807486e/45c34eb407db4cc58406ac09c5b31743/FLAG986a6dd56 [2025-03-16 15:07:00,610 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:07:00,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label51.c [2025-03-16 15:07:00,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5807486e/45c34eb407db4cc58406ac09c5b31743/FLAG986a6dd56 [2025-03-16 15:07:00,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5807486e/45c34eb407db4cc58406ac09c5b31743 [2025-03-16 15:07:00,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:07:00,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:07:00,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:07:00,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:07:00,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:07:00,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:07:00" (1/1) ... [2025-03-16 15:07:00,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a6364d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:00, skipping insertion in model container [2025-03-16 15:07:00,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:07:00" (1/1) ... [2025-03-16 15:07:00,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:07:00,812 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/Problem14_label51.c[3722,3735] [2025-03-16 15:07:00,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:07:00,968 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:07:00,987 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/Problem14_label51.c[3722,3735] [2025-03-16 15:07:01,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:07:01,070 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:07:01,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01 WrapperNode [2025-03-16 15:07:01,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:07:01,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:07:01,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:07:01,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:07:01,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,143 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-16 15:07:01,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:07:01,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:07:01,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:07:01,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:07:01,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,186 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:07:01,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,210 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:07:01,227 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:07:01,227 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:07:01,227 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:07:01,229 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (1/1) ... [2025-03-16 15:07:01,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:07:01,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:01,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:07:01,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:07:01,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:07:01,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:07:01,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:07:01,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:07:01,311 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:07:01,313 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:07:02,289 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-16 15:07:02,289 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:07:02,303 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:07:02,305 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:07:02,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:02 BoogieIcfgContainer [2025-03-16 15:07:02,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:07:02,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:07:02,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:07:02,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:07:02,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:07:00" (1/3) ... [2025-03-16 15:07:02,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75936530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:07:02, skipping insertion in model container [2025-03-16 15:07:02,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:01" (2/3) ... [2025-03-16 15:07:02,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75936530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:07:02, skipping insertion in model container [2025-03-16 15:07:02,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:02" (3/3) ... [2025-03-16 15:07:02,312 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label51.c [2025-03-16 15:07:02,323 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:07:02,325 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label51.c that has 1 procedures, 184 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:07:02,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:07:02,386 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;@14e0b1fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:07:02,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:07:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 15:07:02,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:02,395 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] [2025-03-16 15:07:02,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:02,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash 346957912, now seen corresponding path program 1 times [2025-03-16 15:07:02,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:02,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497984455] [2025-03-16 15:07:02,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:02,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:02,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 15:07:02,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 15:07:02,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:02,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:02,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:02,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497984455] [2025-03-16 15:07:02,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497984455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:02,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:02,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:02,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393763871] [2025-03-16 15:07:02,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:02,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:07:02,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:02,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:07:02,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:07:02,515 INFO L87 Difference]: Start difference. First operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 0 states have call successors, (0), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:02,544 INFO L93 Difference]: Finished difference Result 367 states and 719 transitions. [2025-03-16 15:07:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:07:02,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 15:07:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:02,554 INFO L225 Difference]: With dead ends: 367 [2025-03-16 15:07:02,556 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 15:07:02,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:07:02,561 INFO L435 NwaCegarLoop]: 298 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, 298 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:02,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:07:02,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 15:07:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-16 15:07:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2025-03-16 15:07:02,599 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 34 [2025-03-16 15:07:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:02,600 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2025-03-16 15:07:02,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2025-03-16 15:07:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 15:07:02,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:02,602 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] [2025-03-16 15:07:02,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:07:02,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:02,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:02,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1762577699, now seen corresponding path program 1 times [2025-03-16 15:07:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321884548] [2025-03-16 15:07:02,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:02,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 15:07:02,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 15:07:02,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:02,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321884548] [2025-03-16 15:07:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321884548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:02,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825453479] [2025-03-16 15:07:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:02,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:02,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:02,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:02,850 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:03,872 INFO L93 Difference]: Finished difference Result 717 states and 1175 transitions. [2025-03-16 15:07:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:03,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 15:07:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:03,875 INFO L225 Difference]: With dead ends: 717 [2025-03-16 15:07:03,875 INFO L226 Difference]: Without dead ends: 537 [2025-03-16 15:07:03,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:07:03,878 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 509 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:03,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 15 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:07:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-16 15:07:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-03-16 15:07:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4496268656716418) internal successors, (777), 536 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 777 transitions. [2025-03-16 15:07:03,905 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 777 transitions. Word has length 34 [2025-03-16 15:07:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:03,905 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 777 transitions. [2025-03-16 15:07:03,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 777 transitions. [2025-03-16 15:07:03,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 15:07:03,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:03,911 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 15:07:03,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:07:03,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:03,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash 289650513, now seen corresponding path program 1 times [2025-03-16 15:07:03,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:03,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842268325] [2025-03-16 15:07:03,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:03,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:03,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 15:07:03,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 15:07:03,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:03,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-16 15:07:04,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:04,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842268325] [2025-03-16 15:07:04,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842268325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:04,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:04,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:04,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987187689] [2025-03-16 15:07:04,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:04,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:04,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:04,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:04,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:04,199 INFO L87 Difference]: Start difference. First operand 537 states and 777 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:04,729 INFO L93 Difference]: Finished difference Result 1073 states and 1655 transitions. [2025-03-16 15:07:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:04,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 182 [2025-03-16 15:07:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:04,732 INFO L225 Difference]: With dead ends: 1073 [2025-03-16 15:07:04,732 INFO L226 Difference]: Without dead ends: 715 [2025-03-16 15:07:04,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:04,733 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:04,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 56 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:07:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-16 15:07:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2025-03-16 15:07:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.354341736694678) internal successors, (967), 714 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2025-03-16 15:07:04,765 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 182 [2025-03-16 15:07:04,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:04,765 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2025-03-16 15:07:04,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2025-03-16 15:07:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 15:07:04,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:04,768 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:07:04,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:07:04,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:04,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1560579450, now seen corresponding path program 1 times [2025-03-16 15:07:04,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:04,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122931364] [2025-03-16 15:07:04,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:04,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:04,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 15:07:04,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 15:07:04,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:04,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 15:07:05,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122931364] [2025-03-16 15:07:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122931364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:05,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:05,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:05,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370915641] [2025-03-16 15:07:05,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:05,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:05,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:05,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:05,043 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:05,642 INFO L93 Difference]: Finished difference Result 1636 states and 2267 transitions. [2025-03-16 15:07:05,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:05,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 205 [2025-03-16 15:07:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:05,646 INFO L225 Difference]: With dead ends: 1636 [2025-03-16 15:07:05,646 INFO L226 Difference]: Without dead ends: 1071 [2025-03-16 15:07:05,647 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 15:07:05,651 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:05,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 111 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:07:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-16 15:07:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 893. [2025-03-16 15:07:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.1726457399103138) internal successors, (1046), 892 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1046 transitions. [2025-03-16 15:07:05,666 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1046 transitions. Word has length 205 [2025-03-16 15:07:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:05,666 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1046 transitions. [2025-03-16 15:07:05,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1046 transitions. [2025-03-16 15:07:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-16 15:07:05,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:05,670 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:05,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:07:05,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:05,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash -209010204, now seen corresponding path program 1 times [2025-03-16 15:07:05,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:05,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855836566] [2025-03-16 15:07:05,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:05,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:05,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-16 15:07:05,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-16 15:07:05,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:05,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 229 proven. 100 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-16 15:07:06,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:06,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855836566] [2025-03-16 15:07:06,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855836566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:06,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259712382] [2025-03-16 15:07:06,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:06,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:06,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:06,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:06,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:07:06,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-16 15:07:06,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-16 15:07:06,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:06,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:06,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:06,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2025-03-16 15:07:06,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259712382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:06,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:06,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:07:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285786684] [2025-03-16 15:07:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:06,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:06,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:06,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:06,398 INFO L87 Difference]: Start difference. First operand 893 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:06,854 INFO L93 Difference]: Finished difference Result 2319 states and 2777 transitions. [2025-03-16 15:07:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:06,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 336 [2025-03-16 15:07:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:06,861 INFO L225 Difference]: With dead ends: 2319 [2025-03-16 15:07:06,862 INFO L226 Difference]: Without dead ends: 1605 [2025-03-16 15:07:06,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:06,864 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 146 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:06,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 263 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-16 15:07:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1427. [2025-03-16 15:07:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.1402524544179524) internal successors, (1626), 1426 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1626 transitions. [2025-03-16 15:07:06,886 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1626 transitions. Word has length 336 [2025-03-16 15:07:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:06,888 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1626 transitions. [2025-03-16 15:07:06,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1626 transitions. [2025-03-16 15:07:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-16 15:07:06,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:06,894 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:06,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:07,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:07,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:07,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1063625959, now seen corresponding path program 1 times [2025-03-16 15:07:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:07,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303385221] [2025-03-16 15:07:07,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:07,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:07,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-16 15:07:07,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-16 15:07:07,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:07,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 553 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-16 15:07:07,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:07,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303385221] [2025-03-16 15:07:07,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303385221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:07,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:07,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:07,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692045769] [2025-03-16 15:07:07,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:07,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:07,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:07,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:07,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:07,499 INFO L87 Difference]: Start difference. First operand 1427 states and 1626 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:07,947 INFO L93 Difference]: Finished difference Result 3209 states and 3756 transitions. [2025-03-16 15:07:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2025-03-16 15:07:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:07,953 INFO L225 Difference]: With dead ends: 3209 [2025-03-16 15:07:07,953 INFO L226 Difference]: Without dead ends: 1961 [2025-03-16 15:07:07,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:07,955 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:07,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 76 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-16 15:07:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2025-03-16 15:07:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1341189674523007) internal successors, (2021), 1782 states have internal predecessors, (2021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2021 transitions. [2025-03-16 15:07:07,984 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2021 transitions. Word has length 435 [2025-03-16 15:07:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:07,984 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2021 transitions. [2025-03-16 15:07:07,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2021 transitions. [2025-03-16 15:07:07,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-16 15:07:07,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:07,992 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:07,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:07:07,993 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:07,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1378246229, now seen corresponding path program 1 times [2025-03-16 15:07:07,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:07,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908034202] [2025-03-16 15:07:07,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:07,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:08,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-16 15:07:08,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-16 15:07:08,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:08,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 523 proven. 23 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-16 15:07:08,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908034202] [2025-03-16 15:07:08,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908034202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961503722] [2025-03-16 15:07:08,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:08,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:08,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:08,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:08,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:07:08,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-16 15:07:08,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-16 15:07:08,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:08,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:08,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:08,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2025-03-16 15:07:08,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:08,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961503722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:08,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:08,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:07:08,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640324706] [2025-03-16 15:07:08,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:08,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:08,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:08,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:08,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:08,679 INFO L87 Difference]: Start difference. First operand 1783 states and 2021 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:09,133 INFO L93 Difference]: Finished difference Result 4099 states and 4727 transitions. [2025-03-16 15:07:09,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:09,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 459 [2025-03-16 15:07:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:09,141 INFO L225 Difference]: With dead ends: 4099 [2025-03-16 15:07:09,141 INFO L226 Difference]: Without dead ends: 2495 [2025-03-16 15:07:09,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:09,144 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 146 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:09,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 243 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:09,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-03-16 15:07:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2317. [2025-03-16 15:07:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.1278065630397236) internal successors, (2612), 2316 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2612 transitions. [2025-03-16 15:07:09,184 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2612 transitions. Word has length 459 [2025-03-16 15:07:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:09,185 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2612 transitions. [2025-03-16 15:07:09,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2612 transitions. [2025-03-16 15:07:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-16 15:07:09,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:09,191 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:09,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:09,392 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,SelfDestructingSolverStorable6 [2025-03-16 15:07:09,392 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:09,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash -630568398, now seen corresponding path program 1 times [2025-03-16 15:07:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:09,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802947887] [2025-03-16 15:07:09,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:09,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-16 15:07:09,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-16 15:07:09,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:09,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 561 proven. 23 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-16 15:07:09,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802947887] [2025-03-16 15:07:09,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802947887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939975745] [2025-03-16 15:07:09,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:09,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:09,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:09,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:09,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:07:09,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-16 15:07:09,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-16 15:07:09,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:09,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:09,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:07:09,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-16 15:07:10,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:10,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939975745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:10,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:07:10,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318988090] [2025-03-16 15:07:10,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:10,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:10,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:10,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:10,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:10,477 INFO L87 Difference]: Start difference. First operand 2317 states and 2612 transitions. Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:11,180 INFO L93 Difference]: Finished difference Result 4989 states and 5652 transitions. [2025-03-16 15:07:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:11,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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 478 [2025-03-16 15:07:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:11,187 INFO L225 Difference]: With dead ends: 4989 [2025-03-16 15:07:11,187 INFO L226 Difference]: Without dead ends: 2673 [2025-03-16 15:07:11,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:11,190 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 185 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:11,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 50 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:07:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-03-16 15:07:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2673. [2025-03-16 15:07:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.1220059880239521) internal successors, (2998), 2672 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2998 transitions. [2025-03-16 15:07:11,219 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2998 transitions. Word has length 478 [2025-03-16 15:07:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:11,220 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2998 transitions. [2025-03-16 15:07:11,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2998 transitions. [2025-03-16 15:07:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-16 15:07:11,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:11,224 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:11,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:07:11,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:11,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:11,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash 803748453, now seen corresponding path program 1 times [2025-03-16 15:07:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:11,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600170191] [2025-03-16 15:07:11,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:11,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-16 15:07:11,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-16 15:07:11,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:11,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 727 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-16 15:07:11,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:11,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600170191] [2025-03-16 15:07:11,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600170191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:11,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:11,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093525566] [2025-03-16 15:07:11,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:11,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:11,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:11,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:11,741 INFO L87 Difference]: Start difference. First operand 2673 states and 2998 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:12,220 INFO L93 Difference]: Finished difference Result 5196 states and 5845 transitions. [2025-03-16 15:07:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:12,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 534 [2025-03-16 15:07:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:12,227 INFO L225 Difference]: With dead ends: 5196 [2025-03-16 15:07:12,227 INFO L226 Difference]: Without dead ends: 2673 [2025-03-16 15:07:12,230 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 15:07:12,232 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:12,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 15 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:07:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-03-16 15:07:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2673. [2025-03-16 15:07:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.0853293413173652) internal successors, (2900), 2672 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2900 transitions. [2025-03-16 15:07:12,268 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2900 transitions. Word has length 534 [2025-03-16 15:07:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:12,269 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2900 transitions. [2025-03-16 15:07:12,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2900 transitions. [2025-03-16 15:07:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-03-16 15:07:12,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:12,273 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:12,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:07:12,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:12,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1597842524, now seen corresponding path program 1 times [2025-03-16 15:07:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:12,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013101287] [2025-03-16 15:07:12,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:12,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-03-16 15:07:12,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-03-16 15:07:12,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:12,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 839 proven. 11 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-16 15:07:12,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:12,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013101287] [2025-03-16 15:07:12,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013101287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:12,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833732028] [2025-03-16 15:07:12,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:12,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:12,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:12,707 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:12,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:07:12,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-03-16 15:07:12,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-03-16 15:07:12,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:12,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:12,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:07:12,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-16 15:07:14,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833732028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:14,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:14,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-16 15:07:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117460500] [2025-03-16 15:07:14,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:14,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:14,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:14,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:07:14,192 INFO L87 Difference]: Start difference. First operand 2673 states and 2900 transitions. Second operand has 5 states, 5 states have (on average 64.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:14,796 INFO L93 Difference]: Finished difference Result 5167 states and 5620 transitions. [2025-03-16 15:07:14,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:14,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 64.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 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 560 [2025-03-16 15:07:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:14,803 INFO L225 Difference]: With dead ends: 5167 [2025-03-16 15:07:14,804 INFO L226 Difference]: Without dead ends: 2673 [2025-03-16 15:07:14,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:07:14,806 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 252 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:14,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 54 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:07:14,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-03-16 15:07:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2317. [2025-03-16 15:07:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.0816062176165804) internal successors, (2505), 2316 states have internal predecessors, (2505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2505 transitions. [2025-03-16 15:07:14,836 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2505 transitions. Word has length 560 [2025-03-16 15:07:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:14,837 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2505 transitions. [2025-03-16 15:07:14,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2505 transitions. [2025-03-16 15:07:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2025-03-16 15:07:14,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:14,840 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:14,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:07:15,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:15,045 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:15,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1021736542, now seen corresponding path program 1 times [2025-03-16 15:07:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:15,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005276856] [2025-03-16 15:07:15,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:15,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:15,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 634 statements into 1 equivalence classes. [2025-03-16 15:07:15,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 634 of 634 statements. [2025-03-16 15:07:15,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:15,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 764 proven. 93 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-16 15:07:15,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:15,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005276856] [2025-03-16 15:07:15,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005276856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:15,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359408460] [2025-03-16 15:07:15,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:15,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:15,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:15,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:15,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:07:15,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 634 statements into 1 equivalence classes. [2025-03-16 15:07:15,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 634 of 634 statements. [2025-03-16 15:07:15,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:15,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:15,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:15,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 857 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-16 15:07:15,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:15,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359408460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:15,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:15,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:07:15,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991942709] [2025-03-16 15:07:15,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:15,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:15,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:15,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:15,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:15,776 INFO L87 Difference]: Start difference. First operand 2317 states and 2505 transitions. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:16,132 INFO L93 Difference]: Finished difference Result 5523 states and 6016 transitions. [2025-03-16 15:07:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:16,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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 634 [2025-03-16 15:07:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:16,140 INFO L225 Difference]: With dead ends: 5523 [2025-03-16 15:07:16,140 INFO L226 Difference]: Without dead ends: 3385 [2025-03-16 15:07:16,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:16,142 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:16,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:16,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2025-03-16 15:07:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3385. [2025-03-16 15:07:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.0759456264775413) internal successors, (3641), 3384 states have internal predecessors, (3641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3641 transitions. [2025-03-16 15:07:16,181 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3641 transitions. Word has length 634 [2025-03-16 15:07:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:16,181 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 3641 transitions. [2025-03-16 15:07:16,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3641 transitions. [2025-03-16 15:07:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-16 15:07:16,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:16,187 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:16,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:07:16,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 15:07:16,388 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:16,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1075474540, now seen corresponding path program 1 times [2025-03-16 15:07:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:16,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771457870] [2025-03-16 15:07:16,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:16,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-16 15:07:16,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-16 15:07:16,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:16,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1816 backedges. 1314 proven. 155 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-16 15:07:16,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:16,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771457870] [2025-03-16 15:07:16,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771457870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:16,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194081602] [2025-03-16 15:07:16,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:16,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:16,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:16,754 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 15:07:16,755 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 15:07:16,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-16 15:07:16,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-16 15:07:16,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:16,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:16,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:16,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1816 backedges. 701 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2025-03-16 15:07:16,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:16,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194081602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:16,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:16,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:07:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46937216] [2025-03-16 15:07:16,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:16,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:16,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:16,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:16,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:07:16,998 INFO L87 Difference]: Start difference. First operand 3385 states and 3641 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:17,341 INFO L93 Difference]: Finished difference Result 7125 states and 7729 transitions. [2025-03-16 15:07:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:17,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 789 [2025-03-16 15:07:17,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:17,349 INFO L225 Difference]: With dead ends: 7125 [2025-03-16 15:07:17,349 INFO L226 Difference]: Without dead ends: 3919 [2025-03-16 15:07:17,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:07:17,356 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 80 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:17,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 31 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-03-16 15:07:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3919. [2025-03-16 15:07:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.0819295558958653) internal successors, (4239), 3918 states have internal predecessors, (4239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4239 transitions. [2025-03-16 15:07:17,401 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4239 transitions. Word has length 789 [2025-03-16 15:07:17,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:17,402 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 4239 transitions. [2025-03-16 15:07:17,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4239 transitions. [2025-03-16 15:07:17,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2025-03-16 15:07:17,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:17,408 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:07:17,415 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 15:07:17,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:17,613 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:17,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1987875795, now seen corresponding path program 1 times [2025-03-16 15:07:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223527381] [2025-03-16 15:07:17,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:17,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 818 statements into 1 equivalence classes. [2025-03-16 15:07:17,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 818 of 818 statements. [2025-03-16 15:07:17,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:17,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1895 backedges. 1393 proven. 155 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-16 15:07:17,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:17,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223527381] [2025-03-16 15:07:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223527381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292959937] [2025-03-16 15:07:17,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:17,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:17,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:17,937 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:17,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 15:07:17,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 818 statements into 1 equivalence classes. [2025-03-16 15:07:18,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 818 of 818 statements. [2025-03-16 15:07:18,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:18,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:18,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:07:18,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1895 backedges. 1393 proven. 155 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-16 15:07:18,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:07:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1895 backedges. 1393 proven. 155 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-16 15:07:18,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292959937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:07:18,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:07:18,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 15:07:18,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300479472] [2025-03-16 15:07:18,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:07:18,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:07:18,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:18,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:07:18,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:18,657 INFO L87 Difference]: Start difference. First operand 3919 states and 4239 transitions. Second operand has 6 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:19,352 INFO L93 Difference]: Finished difference Result 9975 states and 10794 transitions. [2025-03-16 15:07:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:07:19,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 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 818 [2025-03-16 15:07:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:19,366 INFO L225 Difference]: With dead ends: 9975 [2025-03-16 15:07:19,366 INFO L226 Difference]: Without dead ends: 6235 [2025-03-16 15:07:19,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1638 GetRequests, 1634 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:19,370 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:19,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 63 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:07:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6235 states. [2025-03-16 15:07:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6235 to 4987. [2025-03-16 15:07:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4986 states have (on average 1.0806257521058966) internal successors, (5388), 4986 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 5388 transitions. [2025-03-16 15:07:19,423 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 5388 transitions. Word has length 818 [2025-03-16 15:07:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:19,424 INFO L471 AbstractCegarLoop]: Abstraction has 4987 states and 5388 transitions. [2025-03-16 15:07:19,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 5388 transitions. [2025-03-16 15:07:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2025-03-16 15:07:19,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:19,453 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:19,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 15:07:19,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:19,653 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:19,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:19,654 INFO L85 PathProgramCache]: Analyzing trace with hash 584162513, now seen corresponding path program 1 times [2025-03-16 15:07:19,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:19,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5126348] [2025-03-16 15:07:19,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:19,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:19,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 908 statements into 1 equivalence classes. [2025-03-16 15:07:19,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 908 of 908 statements. [2025-03-16 15:07:19,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:19,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2377 backedges. 1597 proven. 93 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-16 15:07:20,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:20,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5126348] [2025-03-16 15:07:20,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5126348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:20,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646196053] [2025-03-16 15:07:20,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:20,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:20,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:20,139 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:20,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 15:07:20,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 908 statements into 1 equivalence classes. [2025-03-16 15:07:20,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 908 of 908 statements. [2025-03-16 15:07:20,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:20,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:20,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:07:20,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2377 backedges. 1690 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-16 15:07:20,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:20,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646196053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:20,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:20,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:07:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298106756] [2025-03-16 15:07:20,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:20,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:20,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:20,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:20,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:20,615 INFO L87 Difference]: Start difference. First operand 4987 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:20,931 INFO L93 Difference]: Finished difference Result 10151 states and 10960 transitions. [2025-03-16 15:07:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:20,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 908 [2025-03-16 15:07:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:20,944 INFO L225 Difference]: With dead ends: 10151 [2025-03-16 15:07:20,944 INFO L226 Difference]: Without dead ends: 5343 [2025-03-16 15:07:20,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 907 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:20,948 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:20,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5343 states. [2025-03-16 15:07:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5343 to 5165. [2025-03-16 15:07:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5164 states have (on average 1.0784275755228505) internal successors, (5569), 5164 states have internal predecessors, (5569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 5569 transitions. [2025-03-16 15:07:20,986 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 5569 transitions. Word has length 908 [2025-03-16 15:07:20,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:20,986 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 5569 transitions. [2025-03-16 15:07:20,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:20,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 5569 transitions. [2025-03-16 15:07:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2025-03-16 15:07:20,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:20,993 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:07:21,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:21,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 15:07:21,194 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:21,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:21,195 INFO L85 PathProgramCache]: Analyzing trace with hash 880361624, now seen corresponding path program 1 times [2025-03-16 15:07:21,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:21,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402230780] [2025-03-16 15:07:21,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:21,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:21,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 985 statements into 1 equivalence classes. [2025-03-16 15:07:21,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 985 of 985 statements. [2025-03-16 15:07:21,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:21,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 995 proven. 0 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2025-03-16 15:07:21,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:21,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402230780] [2025-03-16 15:07:21,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402230780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:21,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:21,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:21,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117523727] [2025-03-16 15:07:21,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:21,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:21,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:21,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:21,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:21,794 INFO L87 Difference]: Start difference. First operand 5165 states and 5569 transitions. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:22,125 INFO L93 Difference]: Finished difference Result 10151 states and 10958 transitions. [2025-03-16 15:07:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:22,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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 985 [2025-03-16 15:07:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:22,134 INFO L225 Difference]: With dead ends: 10151 [2025-03-16 15:07:22,134 INFO L226 Difference]: Without dead ends: 5165 [2025-03-16 15:07:22,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:22,139 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 50 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:22,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 224 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2025-03-16 15:07:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 5165. [2025-03-16 15:07:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5164 states have (on average 1.064291247095275) internal successors, (5496), 5164 states have internal predecessors, (5496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 5496 transitions. [2025-03-16 15:07:22,202 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 5496 transitions. Word has length 985 [2025-03-16 15:07:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:22,203 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 5496 transitions. [2025-03-16 15:07:22,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 5496 transitions. [2025-03-16 15:07:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1027 [2025-03-16 15:07:22,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:22,217 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:22,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:07:22,217 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:22,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1678930294, now seen corresponding path program 1 times [2025-03-16 15:07:22,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:22,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127949554] [2025-03-16 15:07:22,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:22,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:22,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1026 statements into 1 equivalence classes. [2025-03-16 15:07:22,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1026 of 1026 statements. [2025-03-16 15:07:22,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:22,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 2762 trivial. 0 not checked. [2025-03-16 15:07:22,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:22,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127949554] [2025-03-16 15:07:22,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127949554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:22,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:22,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:22,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56371275] [2025-03-16 15:07:22,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:22,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:22,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:22,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:22,787 INFO L87 Difference]: Start difference. First operand 5165 states and 5496 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:23,132 INFO L93 Difference]: Finished difference Result 9993 states and 10640 transitions. [2025-03-16 15:07:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 1026 [2025-03-16 15:07:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:23,139 INFO L225 Difference]: With dead ends: 9993 [2025-03-16 15:07:23,140 INFO L226 Difference]: Without dead ends: 4987 [2025-03-16 15:07:23,143 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 15:07:23,144 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:23,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 15 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2025-03-16 15:07:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4987. [2025-03-16 15:07:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4986 states have (on average 1.0627757721620537) internal successors, (5299), 4986 states have internal predecessors, (5299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 5299 transitions. [2025-03-16 15:07:23,180 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 5299 transitions. Word has length 1026 [2025-03-16 15:07:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:23,181 INFO L471 AbstractCegarLoop]: Abstraction has 4987 states and 5299 transitions. [2025-03-16 15:07:23,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 5299 transitions. [2025-03-16 15:07:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2025-03-16 15:07:23,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:23,188 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:23,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:07:23,189 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:23,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:23,190 INFO L85 PathProgramCache]: Analyzing trace with hash 850661715, now seen corresponding path program 1 times [2025-03-16 15:07:23,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:23,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6527614] [2025-03-16 15:07:23,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:23,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1031 statements into 1 equivalence classes. [2025-03-16 15:07:23,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1031 of 1031 statements. [2025-03-16 15:07:23,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:23,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3493 backedges. 2444 proven. 72 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2025-03-16 15:07:24,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:24,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6527614] [2025-03-16 15:07:24,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6527614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:24,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115372853] [2025-03-16 15:07:24,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:24,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:24,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:24,016 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:24,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 15:07:24,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1031 statements into 1 equivalence classes. [2025-03-16 15:07:24,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1031 of 1031 statements. [2025-03-16 15:07:24,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:24,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:24,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:07:24,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3493 backedges. 2453 proven. 616 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-16 15:07:24,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:07:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3493 backedges. 2516 proven. 0 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2025-03-16 15:07:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115372853] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:25,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:07:25,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-03-16 15:07:25,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934620188] [2025-03-16 15:07:25,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:25,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:25,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:25,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:25,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:25,197 INFO L87 Difference]: Start difference. First operand 4987 states and 5299 transitions. Second operand has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:25,638 INFO L93 Difference]: Finished difference Result 10507 states and 11173 transitions. [2025-03-16 15:07:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:25,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 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 1031 [2025-03-16 15:07:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:25,649 INFO L225 Difference]: With dead ends: 10507 [2025-03-16 15:07:25,649 INFO L226 Difference]: Without dead ends: 5699 [2025-03-16 15:07:25,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2065 GetRequests, 2057 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:25,655 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:25,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 8 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:25,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2025-03-16 15:07:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5165. [2025-03-16 15:07:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5164 states have (on average 1.0613865220759102) internal successors, (5481), 5164 states have internal predecessors, (5481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 5481 transitions. [2025-03-16 15:07:25,697 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 5481 transitions. Word has length 1031 [2025-03-16 15:07:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:25,698 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 5481 transitions. [2025-03-16 15:07:25,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 5481 transitions. [2025-03-16 15:07:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2025-03-16 15:07:25,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:25,705 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:25,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 15:07:25,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 15:07:25,906 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:25,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash -587669896, now seen corresponding path program 1 times [2025-03-16 15:07:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:25,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552644878] [2025-03-16 15:07:25,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:25,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:25,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1076 statements into 1 equivalence classes. [2025-03-16 15:07:25,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1076 of 1076 statements. [2025-03-16 15:07:25,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:25,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3731 backedges. 1083 proven. 0 refuted. 0 times theorem prover too weak. 2648 trivial. 0 not checked. [2025-03-16 15:07:26,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552644878] [2025-03-16 15:07:26,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552644878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:26,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:26,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:26,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059322326] [2025-03-16 15:07:26,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:26,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:26,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:26,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:26,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:26,203 INFO L87 Difference]: Start difference. First operand 5165 states and 5481 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:26,489 INFO L93 Difference]: Finished difference Result 10507 states and 11163 transitions. [2025-03-16 15:07:26,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:26,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 1076 [2025-03-16 15:07:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:26,496 INFO L225 Difference]: With dead ends: 10507 [2025-03-16 15:07:26,496 INFO L226 Difference]: Without dead ends: 5521 [2025-03-16 15:07:26,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:26,500 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:26,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 56 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2025-03-16 15:07:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 5521. [2025-03-16 15:07:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5521 states, 5520 states have (on average 1.0603260869565216) internal successors, (5853), 5520 states have internal predecessors, (5853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5521 states to 5521 states and 5853 transitions. [2025-03-16 15:07:26,538 INFO L78 Accepts]: Start accepts. Automaton has 5521 states and 5853 transitions. Word has length 1076 [2025-03-16 15:07:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:26,539 INFO L471 AbstractCegarLoop]: Abstraction has 5521 states and 5853 transitions. [2025-03-16 15:07:26,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5521 states and 5853 transitions. [2025-03-16 15:07:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2025-03-16 15:07:26,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:26,547 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:26,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:07:26,547 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:26,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1635033916, now seen corresponding path program 1 times [2025-03-16 15:07:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421510679] [2025-03-16 15:07:26,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:26,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:26,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1108 statements into 1 equivalence classes. [2025-03-16 15:07:26,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1108 of 1108 statements. [2025-03-16 15:07:26,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:26,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3817 backedges. 2768 proven. 72 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2025-03-16 15:07:27,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421510679] [2025-03-16 15:07:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421510679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083948621] [2025-03-16 15:07:27,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:27,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:27,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:27,511 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:27,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 15:07:27,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1108 statements into 1 equivalence classes. [2025-03-16 15:07:27,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1108 of 1108 statements. [2025-03-16 15:07:27,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:27,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:27,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:07:27,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3817 backedges. 2481 proven. 0 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2025-03-16 15:07:28,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083948621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:28,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:28,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-16 15:07:28,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955927252] [2025-03-16 15:07:28,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:28,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:28,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:28,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:28,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:28,003 INFO L87 Difference]: Start difference. First operand 5521 states and 5853 transitions. Second operand has 4 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:28,489 INFO L93 Difference]: Finished difference Result 12109 states and 12827 transitions. [2025-03-16 15:07:28,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:28,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 0 states have call successors, (0), 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 1108 [2025-03-16 15:07:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:28,498 INFO L225 Difference]: With dead ends: 12109 [2025-03-16 15:07:28,498 INFO L226 Difference]: Without dead ends: 6767 [2025-03-16 15:07:28,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 1107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:28,503 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:28,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 46 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:07:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6767 states. [2025-03-16 15:07:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6767 to 5877. [2025-03-16 15:07:28,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5877 states, 5876 states have (on average 1.0576923076923077) internal successors, (6215), 5876 states have internal predecessors, (6215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5877 states to 5877 states and 6215 transitions. [2025-03-16 15:07:28,566 INFO L78 Accepts]: Start accepts. Automaton has 5877 states and 6215 transitions. Word has length 1108 [2025-03-16 15:07:28,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:28,567 INFO L471 AbstractCegarLoop]: Abstraction has 5877 states and 6215 transitions. [2025-03-16 15:07:28,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 5877 states and 6215 transitions. [2025-03-16 15:07:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1179 [2025-03-16 15:07:28,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:28,576 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:28,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 15:07:28,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:28,777 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:28,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash 483768410, now seen corresponding path program 1 times [2025-03-16 15:07:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:28,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978032263] [2025-03-16 15:07:28,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:28,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:28,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1178 statements into 1 equivalence classes. [2025-03-16 15:07:28,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1178 of 1178 statements. [2025-03-16 15:07:28,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:28,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4623 backedges. 2440 proven. 202 refuted. 0 times theorem prover too weak. 1981 trivial. 0 not checked. [2025-03-16 15:07:29,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:29,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978032263] [2025-03-16 15:07:29,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978032263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:29,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230450390] [2025-03-16 15:07:29,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:29,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:29,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:29,795 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:29,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 15:07:29,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1178 statements into 1 equivalence classes. [2025-03-16 15:07:30,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1178 of 1178 statements. [2025-03-16 15:07:30,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:30,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:30,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 1443 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:07:30,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4623 backedges. 1942 proven. 0 refuted. 0 times theorem prover too weak. 2681 trivial. 0 not checked. [2025-03-16 15:07:31,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:31,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230450390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:31,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:31,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-16 15:07:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680924499] [2025-03-16 15:07:31,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:31,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:31,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:31,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:31,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:07:31,118 INFO L87 Difference]: Start difference. First operand 5877 states and 6215 transitions. Second operand has 5 states, 5 states have (on average 78.8) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:31,604 INFO L93 Difference]: Finished difference Result 11604 states and 12279 transitions. [2025-03-16 15:07:31,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:07:31,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 78.8) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 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 1178 [2025-03-16 15:07:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:31,612 INFO L225 Difference]: With dead ends: 11604 [2025-03-16 15:07:31,612 INFO L226 Difference]: Without dead ends: 5906 [2025-03-16 15:07:31,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1182 GetRequests, 1176 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:07:31,616 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 151 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:31,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 19 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:07:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5906 states. [2025-03-16 15:07:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5906 to 5877. [2025-03-16 15:07:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5877 states, 5876 states have (on average 1.0566712049012934) internal successors, (6209), 5876 states have internal predecessors, (6209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5877 states to 5877 states and 6209 transitions. [2025-03-16 15:07:31,664 INFO L78 Accepts]: Start accepts. Automaton has 5877 states and 6209 transitions. Word has length 1178 [2025-03-16 15:07:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:31,664 INFO L471 AbstractCegarLoop]: Abstraction has 5877 states and 6209 transitions. [2025-03-16 15:07:31,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.8) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5877 states and 6209 transitions. [2025-03-16 15:07:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1391 [2025-03-16 15:07:31,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:31,675 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:31,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-16 15:07:31,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:31,876 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:31,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:31,877 INFO L85 PathProgramCache]: Analyzing trace with hash -816601243, now seen corresponding path program 1 times [2025-03-16 15:07:31,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:31,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222765151] [2025-03-16 15:07:31,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:31,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:31,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1390 statements into 1 equivalence classes. [2025-03-16 15:07:31,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1390 of 1390 statements. [2025-03-16 15:07:31,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:31,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5939 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 5577 trivial. 0 not checked. [2025-03-16 15:07:32,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:32,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222765151] [2025-03-16 15:07:32,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222765151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:32,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:32,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166241181] [2025-03-16 15:07:32,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:32,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:32,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:32,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:32,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:32,321 INFO L87 Difference]: Start difference. First operand 5877 states and 6209 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:32,611 INFO L93 Difference]: Finished difference Result 11575 states and 12238 transitions. [2025-03-16 15:07:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:32,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 1390 [2025-03-16 15:07:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:32,618 INFO L225 Difference]: With dead ends: 11575 [2025-03-16 15:07:32,619 INFO L226 Difference]: Without dead ends: 5877 [2025-03-16 15:07:32,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:32,623 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 149 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:32,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 207 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5877 states. [2025-03-16 15:07:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5877 to 5521. [2025-03-16 15:07:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5521 states, 5520 states have (on average 1.0525362318840579) internal successors, (5810), 5520 states have internal predecessors, (5810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5521 states to 5521 states and 5810 transitions. [2025-03-16 15:07:32,665 INFO L78 Accepts]: Start accepts. Automaton has 5521 states and 5810 transitions. Word has length 1390 [2025-03-16 15:07:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:32,666 INFO L471 AbstractCegarLoop]: Abstraction has 5521 states and 5810 transitions. [2025-03-16 15:07:32,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:32,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5521 states and 5810 transitions. [2025-03-16 15:07:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1493 [2025-03-16 15:07:32,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:32,678 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:32,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:07:32,678 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:32,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash 409960327, now seen corresponding path program 1 times [2025-03-16 15:07:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634528712] [2025-03-16 15:07:32,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:32,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1492 statements into 1 equivalence classes. [2025-03-16 15:07:32,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1492 of 1492 statements. [2025-03-16 15:07:32,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:32,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7035 backedges. 4438 proven. 252 refuted. 0 times theorem prover too weak. 2345 trivial. 0 not checked. [2025-03-16 15:07:33,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634528712] [2025-03-16 15:07:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634528712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684608472] [2025-03-16 15:07:33,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:33,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:33,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:33,600 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:33,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 15:07:33,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1492 statements into 1 equivalence classes. [2025-03-16 15:07:33,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1492 of 1492 statements. [2025-03-16 15:07:33,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:33,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:33,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 1798 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:07:33,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7035 backedges. 2426 proven. 0 refuted. 0 times theorem prover too weak. 4609 trivial. 0 not checked. [2025-03-16 15:07:34,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684608472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:34,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:34,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:07:34,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200891902] [2025-03-16 15:07:34,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:34,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:34,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:34,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:34,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:34,053 INFO L87 Difference]: Start difference. First operand 5521 states and 5810 transitions. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:34,375 INFO L93 Difference]: Finished difference Result 10863 states and 11440 transitions. [2025-03-16 15:07:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:34,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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 1492 [2025-03-16 15:07:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:34,384 INFO L225 Difference]: With dead ends: 10863 [2025-03-16 15:07:34,384 INFO L226 Difference]: Without dead ends: 5521 [2025-03-16 15:07:34,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1496 GetRequests, 1491 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:34,389 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 74 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:34,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 232 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2025-03-16 15:07:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 5343. [2025-03-16 15:07:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 5342 states have (on average 1.048858105578435) internal successors, (5603), 5342 states have internal predecessors, (5603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 5603 transitions. [2025-03-16 15:07:34,428 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 5603 transitions. Word has length 1492 [2025-03-16 15:07:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:34,429 INFO L471 AbstractCegarLoop]: Abstraction has 5343 states and 5603 transitions. [2025-03-16 15:07:34,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 5603 transitions. [2025-03-16 15:07:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2025-03-16 15:07:34,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:34,442 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:34,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-16 15:07:34,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-16 15:07:34,642 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:34,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1765877804, now seen corresponding path program 1 times [2025-03-16 15:07:34,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720727647] [2025-03-16 15:07:34,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:34,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-03-16 15:07:34,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-03-16 15:07:34,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:34,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8542 backedges. 4927 proven. 0 refuted. 0 times theorem prover too weak. 3615 trivial. 0 not checked. [2025-03-16 15:07:36,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:36,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720727647] [2025-03-16 15:07:36,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720727647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:36,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:36,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 15:07:36,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398659639] [2025-03-16 15:07:36,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:36,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 15:07:36,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:36,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 15:07:36,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:36,684 INFO L87 Difference]: Start difference. First operand 5343 states and 5603 transitions. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:37,662 INFO L93 Difference]: Finished difference Result 13906 states and 14647 transitions. [2025-03-16 15:07:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 15:07:37,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 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 1645 [2025-03-16 15:07:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:37,674 INFO L225 Difference]: With dead ends: 13906 [2025-03-16 15:07:37,674 INFO L226 Difference]: Without dead ends: 8727 [2025-03-16 15:07:37,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:37,680 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:37,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 38 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:07:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8727 states. [2025-03-16 15:07:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8727 to 7657. [2025-03-16 15:07:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7657 states, 7656 states have (on average 1.0436259143155695) internal successors, (7990), 7656 states have internal predecessors, (7990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7657 states to 7657 states and 7990 transitions. [2025-03-16 15:07:37,763 INFO L78 Accepts]: Start accepts. Automaton has 7657 states and 7990 transitions. Word has length 1645 [2025-03-16 15:07:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:37,764 INFO L471 AbstractCegarLoop]: Abstraction has 7657 states and 7990 transitions. [2025-03-16 15:07:37,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 7657 states and 7990 transitions. [2025-03-16 15:07:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1725 [2025-03-16 15:07:37,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:37,778 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:37,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:07:37,779 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:37,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:37,779 INFO L85 PathProgramCache]: Analyzing trace with hash 294062628, now seen corresponding path program 1 times [2025-03-16 15:07:37,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:37,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61576864] [2025-03-16 15:07:37,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:37,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1724 statements into 1 equivalence classes. [2025-03-16 15:07:37,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1724 of 1724 statements. [2025-03-16 15:07:37,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:37,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9719 backedges. 6578 proven. 0 refuted. 0 times theorem prover too weak. 3141 trivial. 0 not checked. [2025-03-16 15:07:39,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:39,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61576864] [2025-03-16 15:07:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61576864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:39,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:39,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:07:39,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678652664] [2025-03-16 15:07:39,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:39,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:39,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:39,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:39,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:39,200 INFO L87 Difference]: Start difference. First operand 7657 states and 7990 transitions. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:39,656 INFO L93 Difference]: Finished difference Result 15313 states and 15994 transitions. [2025-03-16 15:07:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 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 1724 [2025-03-16 15:07:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:39,662 INFO L225 Difference]: With dead ends: 15313 [2025-03-16 15:07:39,662 INFO L226 Difference]: Without dead ends: 7835 [2025-03-16 15:07:39,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:39,666 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:39,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 212 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2025-03-16 15:07:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 7479. [2025-03-16 15:07:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7479 states, 7478 states have (on average 1.0370419898368548) internal successors, (7755), 7478 states have internal predecessors, (7755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7479 states to 7479 states and 7755 transitions. [2025-03-16 15:07:39,725 INFO L78 Accepts]: Start accepts. Automaton has 7479 states and 7755 transitions. Word has length 1724 [2025-03-16 15:07:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:39,726 INFO L471 AbstractCegarLoop]: Abstraction has 7479 states and 7755 transitions. [2025-03-16 15:07:39,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 7479 states and 7755 transitions. [2025-03-16 15:07:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1813 [2025-03-16 15:07:39,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:39,742 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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 15:07:39,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:07:39,742 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:39,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2073880410, now seen corresponding path program 1 times [2025-03-16 15:07:39,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:39,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469871403] [2025-03-16 15:07:39,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:39,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:39,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1812 statements into 1 equivalence classes. [2025-03-16 15:07:39,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1812 of 1812 statements. [2025-03-16 15:07:39,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:39,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10875 backedges. 2724 proven. 0 refuted. 0 times theorem prover too weak. 8151 trivial. 0 not checked. [2025-03-16 15:07:41,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:41,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469871403] [2025-03-16 15:07:41,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469871403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:41,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:41,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:07:41,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721445689] [2025-03-16 15:07:41,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:41,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:41,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:41,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:41,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:41,459 INFO L87 Difference]: Start difference. First operand 7479 states and 7755 transitions. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:42,002 INFO L93 Difference]: Finished difference Result 16025 states and 16631 transitions. [2025-03-16 15:07:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:42,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 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 1812 [2025-03-16 15:07:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:42,011 INFO L225 Difference]: With dead ends: 16025 [2025-03-16 15:07:42,011 INFO L226 Difference]: Without dead ends: 8725 [2025-03-16 15:07:42,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:42,017 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 242 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:42,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 16 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:07:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8725 states. [2025-03-16 15:07:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8725 to 7301. [2025-03-16 15:07:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7301 states, 7300 states have (on average 1.04) internal successors, (7592), 7300 states have internal predecessors, (7592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7301 states to 7301 states and 7592 transitions. [2025-03-16 15:07:42,099 INFO L78 Accepts]: Start accepts. Automaton has 7301 states and 7592 transitions. Word has length 1812 [2025-03-16 15:07:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:42,100 INFO L471 AbstractCegarLoop]: Abstraction has 7301 states and 7592 transitions. [2025-03-16 15:07:42,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 7301 states and 7592 transitions. [2025-03-16 15:07:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2014 [2025-03-16 15:07:42,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:42,125 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 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 15:07:42,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 15:07:42,126 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:42,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1554310512, now seen corresponding path program 1 times [2025-03-16 15:07:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:42,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645652000] [2025-03-16 15:07:42,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:42,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:42,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2013 statements into 1 equivalence classes. [2025-03-16 15:07:42,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2013 of 2013 statements. [2025-03-16 15:07:42,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:42,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 13756 backedges. 9287 proven. 184 refuted. 0 times theorem prover too weak. 4285 trivial. 0 not checked. [2025-03-16 15:07:43,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:43,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645652000] [2025-03-16 15:07:43,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645652000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:43,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746791373] [2025-03-16 15:07:43,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:43,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:43,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:43,337 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:43,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-16 15:07:43,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2013 statements into 1 equivalence classes. [2025-03-16 15:07:43,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2013 of 2013 statements. [2025-03-16 15:07:43,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:43,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:43,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 2421 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:07:43,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13756 backedges. 4568 proven. 0 refuted. 0 times theorem prover too weak. 9188 trivial. 0 not checked. [2025-03-16 15:07:43,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:43,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746791373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:43,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:43,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:07:43,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102674687] [2025-03-16 15:07:43,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:43,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:43,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:43,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:43,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:43,891 INFO L87 Difference]: Start difference. First operand 7301 states and 7592 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:44,184 INFO L93 Difference]: Finished difference Result 15135 states and 15733 transitions. [2025-03-16 15:07:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 2013 [2025-03-16 15:07:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:44,191 INFO L225 Difference]: With dead ends: 15135 [2025-03-16 15:07:44,191 INFO L226 Difference]: Without dead ends: 7835 [2025-03-16 15:07:44,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2017 GetRequests, 2012 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:44,196 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 55 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:44,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 220 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2025-03-16 15:07:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 7123. [2025-03-16 15:07:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7123 states, 7122 states have (on average 1.0324347093513058) internal successors, (7353), 7122 states have internal predecessors, (7353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7123 states to 7123 states and 7353 transitions. [2025-03-16 15:07:44,256 INFO L78 Accepts]: Start accepts. Automaton has 7123 states and 7353 transitions. Word has length 2013 [2025-03-16 15:07:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:44,256 INFO L471 AbstractCegarLoop]: Abstraction has 7123 states and 7353 transitions. [2025-03-16 15:07:44,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 7123 states and 7353 transitions. [2025-03-16 15:07:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2115 [2025-03-16 15:07:44,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:44,276 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 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] [2025-03-16 15:07:44,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-16 15:07:44,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 15:07:44,476 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:44,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1900475461, now seen corresponding path program 1 times [2025-03-16 15:07:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:44,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364094103] [2025-03-16 15:07:44,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:44,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:44,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2114 statements into 1 equivalence classes. [2025-03-16 15:07:44,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2114 of 2114 statements. [2025-03-16 15:07:44,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:44,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14461 backedges. 3142 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2025-03-16 15:07:46,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:46,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364094103] [2025-03-16 15:07:46,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364094103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:46,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:46,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:07:46,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501047687] [2025-03-16 15:07:46,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:46,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:46,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:46,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:46,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:46,515 INFO L87 Difference]: Start difference. First operand 7123 states and 7353 transitions. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:46,847 INFO L93 Difference]: Finished difference Result 14599 states and 15063 transitions. [2025-03-16 15:07:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:46,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 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 2114 [2025-03-16 15:07:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:46,849 INFO L225 Difference]: With dead ends: 14599 [2025-03-16 15:07:46,849 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:07:46,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:46,854 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 241 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:46,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 7 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:07:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:07:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:07:46,855 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2114 [2025-03-16 15:07:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:46,856 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:07:46,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:07:46,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:07:46,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:07:46,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 15:07:46,862 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-16 15:07:46,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:07:47,741 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:07:47,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:07:47 BoogieIcfgContainer [2025-03-16 15:07:47,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:07:47,758 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:07:47,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:07:47,758 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:07:47,759 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:02" (3/4) ... [2025-03-16 15:07:47,761 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:07:47,773 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 15:07:47,774 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:07:47,774 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:07:47,775 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:07:47,881 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:07:47,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:07:47,884 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:07:47,884 INFO L158 Benchmark]: Toolchain (without parser) took 47242.90ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 103.1MB in the beginning and 931.4MB in the end (delta: -828.3MB). Peak memory consumption was 605.3MB. Max. memory is 16.1GB. [2025-03-16 15:07:47,885 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:07:47,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.34ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 71.3MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:07:47,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.69ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 61.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:07:47,885 INFO L158 Benchmark]: Boogie Preprocessor took 82.52ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 50.8MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:07:47,886 INFO L158 Benchmark]: IcfgBuilder took 1078.22ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 68.7MB in the end (delta: -17.9MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2025-03-16 15:07:47,886 INFO L158 Benchmark]: TraceAbstraction took 45450.40ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 68.7MB in the beginning and 943.9MB in the end (delta: -875.2MB). Peak memory consumption was 555.8MB. Max. memory is 16.1GB. [2025-03-16 15:07:47,886 INFO L158 Benchmark]: Witness Printer took 126.11ms. Allocated memory is still 1.6GB. Free memory was 943.9MB in the beginning and 931.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:07:47,888 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.34ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 71.3MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.69ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 61.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.52ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 50.8MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1078.22ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 68.7MB in the end (delta: -17.9MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45450.40ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 68.7MB in the beginning and 943.9MB in the end (delta: -875.2MB). Peak memory consumption was 555.8MB. Max. memory is 16.1GB. * Witness Printer took 126.11ms. Allocated memory is still 1.6GB. Free memory was 943.9MB in the beginning and 931.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 119]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 184 locations, 360 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.5s, OverallIterations: 27, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3422 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3422 mSDsluCounter, 2690 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 1874 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16360 IncrementalHoareTripleChecker+Invalid, 18234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1874 mSolverCounterUnsat, 2525 mSDtfsCounter, 16360 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13742 GetRequests, 13654 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7657occurred in iteration=23, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 8043 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 36804 NumberOfCodeBlocks, 36804 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 38611 ConstructedInterpolants, 0 QuantifiedInterpolants, 107441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 14556 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 42 InterpolantComputations, 26 PerfectInterpolantSequences, 150407/152768 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Location Invariant Derived location invariant: ((((((((((((((((((((((((a12 <= 80) && (a24 == 1)) && (a15 <= 8)) && (20 <= a12)) && (7 != a15)) || ((((a21 == 8) && (a24 == 1)) && (a15 <= 8)) && (((long long) a12 + 42) <= 0))) || ((((a24 == 1) && (9 <= a15)) && (a12 <= 599999)) && (95382 <= a12))) || (((((a12 <= 80) && (a21 == 8)) && (a24 == 1)) && (9 <= a15)) && (20 <= a12))) || (((a21 == 8) && (a24 == 1)) && (((long long) a12 + 9352) <= 0))) || ((((a24 == 1) && (20 <= a12)) && (10 <= a21)) && (a12 <= 586307))) || (((((103531 <= a12) && (a21 == 8)) && (a24 == 1)) && (a12 <= 600129)) && (7 == a15))) || (((a24 == 1) && (((long long) a12 + 9352) <= 0)) && (10 <= a21))) || (((((9 <= a21) && (a12 <= 80)) && (a24 == 1)) && (a15 <= 8)) && (7 != a15))) || (((a24 == 1) && (a15 <= 8)) && (((long long) 49 + a12) <= 0))) || (((((a12 <= 80) && (a24 == 1)) && (12 <= a12)) && (a21 == 9)) && (7 == a15))) || (((a15 <= 8) && (a21 <= 6)) && (((long long) a12 + 9352) <= 0))) || ((((a12 <= 11) && (a24 == 1)) && (7 == a21)) && (a15 <= 8))) || (((((a24 == 1) && (9 <= a15)) && (7 == a21)) && (81 <= a12)) && (a12 <= 586307))) || ((a12 <= 599999) && ((((a24 == 1) && (a15 <= 8)) && (a21 <= 6)) || (((a24 == 1) && (a15 <= 8)) && (10 <= a21))))) || (((((a12 <= 80) && (a24 == 1)) && (7 == a21)) && (a15 <= 8)) && (20 <= a12))) || (((((a12 <= 11) && (a21 == 8)) && (a24 == 1)) && (9 <= a15)) && (0 <= ((long long) 41 + a12)))) || ((((a12 <= 11) && (a24 == 1)) && (10 <= a21)) && (0 <= ((long long) 41 + a12)))) || ((((a21 == 8) && (a24 == 1)) && (81 <= a12)) && (a12 <= 586307))) || ((((a24 == 1) && (a21 == 9)) && (81 <= a12)) && (a12 <= 586307))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:07:47,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE