./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label19.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 5b769442af2d950aaf4b68e467259bd2e1d98c5d8ca4dcdd5a740ef956112baf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:47:21,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:47:21,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:47:21,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:47:21,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:47:21,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:47:21,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:47:21,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:47:21,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:47:21,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:47:21,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:47:21,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:47:21,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:47:21,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:47:21,296 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:47:21,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:47:21,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:47:21,296 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:47:21,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:47:21,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:47:21,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:47:21,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:47:21,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:47:21,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:47:21,297 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:47:21,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:47:21,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:47:21,297 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:47:21,297 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:47:21,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:47:21,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:47:21,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:47:21,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:47:21,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:47:21,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:47:21,298 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:47:21,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:47:21,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:47:21,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:47:21,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:47:21,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:47:21,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:47:21,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:47:21,299 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 -> 5b769442af2d950aaf4b68e467259bd2e1d98c5d8ca4dcdd5a740ef956112baf [2025-03-03 10:47:21,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:47:21,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:47:21,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:47:21,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:47:21,549 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:47:21,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label19.c [2025-03-03 10:47:22,667 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919b23c50/5d831391c5094e8394b52bbda71fb82d/FLAGd1c3f9b86 [2025-03-03 10:47:22,956 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:47:22,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label19.c [2025-03-03 10:47:22,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919b23c50/5d831391c5094e8394b52bbda71fb82d/FLAGd1c3f9b86 [2025-03-03 10:47:22,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919b23c50/5d831391c5094e8394b52bbda71fb82d [2025-03-03 10:47:22,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:47:22,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:47:22,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:47:22,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:47:22,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:47:22,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:22" (1/1) ... [2025-03-03 10:47:22,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743c8c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:22, skipping insertion in model container [2025-03-03 10:47:22,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:22" (1/1) ... [2025-03-03 10:47:23,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:47:23,166 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_label19.c[6323,6336] [2025-03-03 10:47:23,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:47:23,312 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:47:23,331 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_label19.c[6323,6336] [2025-03-03 10:47:23,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:47:23,417 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:47:23,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23 WrapperNode [2025-03-03 10:47:23,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:47:23,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:47:23,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:47:23,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:47:23,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,495 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-03 10:47:23,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:47:23,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:47:23,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:47:23,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:47:23,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,544 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:47:23,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:47:23,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:47:23,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:47:23,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:47:23,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (1/1) ... [2025-03-03 10:47:23,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:47:23,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:23,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:47:23,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:47:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:47:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:47:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:47:23,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:47:23,680 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:47:23,683 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:47:24,641 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-03 10:47:24,642 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:47:24,655 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:47:24,655 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:47:24,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:24 BoogieIcfgContainer [2025-03-03 10:47:24,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:47:24,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:47:24,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:47:24,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:47:24,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:47:22" (1/3) ... [2025-03-03 10:47:24,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc5ac35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:24, skipping insertion in model container [2025-03-03 10:47:24,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:23" (2/3) ... [2025-03-03 10:47:24,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc5ac35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:24, skipping insertion in model container [2025-03-03 10:47:24,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:24" (3/3) ... [2025-03-03 10:47:24,662 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label19.c [2025-03-03 10:47:24,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:47:24,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label19.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:47:24,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:47:24,725 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;@732aea2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:47:24,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:47:24,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 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-03 10:47:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 10:47:24,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:24,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:24,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:24,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:24,741 INFO L85 PathProgramCache]: Analyzing trace with hash 609789482, now seen corresponding path program 1 times [2025-03-03 10:47:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:24,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408621438] [2025-03-03 10:47:24,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:24,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 10:47:24,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 10:47:24,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:24,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:47:25,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:25,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408621438] [2025-03-03 10:47:25,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408621438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:25,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:25,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996452100] [2025-03-03 10:47:25,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:25,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:25,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:25,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:25,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:47:25,125 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-03 10:47:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:26,356 INFO L93 Difference]: Finished difference Result 850 states and 1554 transitions. [2025-03-03 10:47:26,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:26,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 10:47:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:26,365 INFO L225 Difference]: With dead ends: 850 [2025-03-03 10:47:26,365 INFO L226 Difference]: Without dead ends: 538 [2025-03-03 10:47:26,368 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-03 10:47:26,370 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 465 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:26,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 194 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:47:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-03 10:47:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-03-03 10:47:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4487895716945995) internal successors, (778), 537 states have internal predecessors, (778), 0 states have call successors, (0), 0 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-03 10:47:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2025-03-03 10:47:26,434 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 62 [2025-03-03 10:47:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:26,435 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2025-03-03 10:47:26,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-03 10:47:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2025-03-03 10:47:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 10:47:26,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:26,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-03 10:47:26,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:47:26,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:26,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash 733023489, now seen corresponding path program 1 times [2025-03-03 10:47:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091689587] [2025-03-03 10:47:26,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:26,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 10:47:26,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 10:47:26,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:26,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:47:26,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:26,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091689587] [2025-03-03 10:47:26,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091689587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:26,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:26,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155607869] [2025-03-03 10:47:26,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:26,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:26,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:26,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:26,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:47:26,744 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-03 10:47:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:27,362 INFO L93 Difference]: Finished difference Result 1283 states and 1979 transitions. [2025-03-03 10:47:27,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:27,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-03 10:47:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:27,366 INFO L225 Difference]: With dead ends: 1283 [2025-03-03 10:47:27,367 INFO L226 Difference]: Without dead ends: 896 [2025-03-03 10:47:27,369 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-03 10:47:27,370 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 118 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:27,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 121 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:47:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-03 10:47:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 894. [2025-03-03 10:47:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.1836506159014557) internal successors, (1057), 893 states have internal predecessors, (1057), 0 states have call successors, (0), 0 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-03 10:47:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1057 transitions. [2025-03-03 10:47:27,402 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1057 transitions. Word has length 142 [2025-03-03 10:47:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:27,402 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1057 transitions. [2025-03-03 10:47:27,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-03 10:47:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1057 transitions. [2025-03-03 10:47:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 10:47:27,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:27,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:27,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:47:27,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:27,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash -131410699, now seen corresponding path program 1 times [2025-03-03 10:47:27,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:27,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626561150] [2025-03-03 10:47:27,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:27,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:27,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 10:47:27,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 10:47:27,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:27,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:47:27,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626561150] [2025-03-03 10:47:27,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626561150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265515715] [2025-03-03 10:47:27,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:27,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:27,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:47:27,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:47:27,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 10:47:28,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 10:47:28,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:28,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:28,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:28,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-03 10:47:28,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:28,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265515715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:28,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:28,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 10:47:28,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681574935] [2025-03-03 10:47:28,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:28,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:28,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:28,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:28,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:47:28,261 INFO L87 Difference]: Start difference. First operand 894 states and 1057 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-03 10:47:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:28,716 INFO L93 Difference]: Finished difference Result 1964 states and 2439 transitions. [2025-03-03 10:47:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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 233 [2025-03-03 10:47:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:28,723 INFO L225 Difference]: With dead ends: 1964 [2025-03-03 10:47:28,723 INFO L226 Difference]: Without dead ends: 1250 [2025-03-03 10:47:28,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:47:28,725 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:28,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 47 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-03 10:47:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2025-03-03 10:47:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.188150520416333) internal successors, (1484), 1249 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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-03 10:47:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1484 transitions. [2025-03-03 10:47:28,754 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1484 transitions. Word has length 233 [2025-03-03 10:47:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:28,754 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1484 transitions. [2025-03-03 10:47:28,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-03 10:47:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1484 transitions. [2025-03-03 10:47:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 10:47:28,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:28,757 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:47:28,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:47:28,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:28,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:28,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1802789660, now seen corresponding path program 1 times [2025-03-03 10:47:28,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:28,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533982838] [2025-03-03 10:47:28,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:28,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:28,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 10:47:28,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 10:47:28,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:28,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:47:29,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:29,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533982838] [2025-03-03 10:47:29,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533982838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:29,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:29,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:29,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832828122] [2025-03-03 10:47:29,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:29,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:29,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:29,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:29,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:29,164 INFO L87 Difference]: Start difference. First operand 1250 states and 1484 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-03 10:47:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:29,598 INFO L93 Difference]: Finished difference Result 2854 states and 3434 transitions. [2025-03-03 10:47:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:29,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2025-03-03 10:47:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:29,604 INFO L225 Difference]: With dead ends: 2854 [2025-03-03 10:47:29,604 INFO L226 Difference]: Without dead ends: 1784 [2025-03-03 10:47:29,605 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-03 10:47:29,606 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:29,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-03-03 10:47:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2025-03-03 10:47:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1542344363432417) internal successors, (2058), 1783 states have internal predecessors, (2058), 0 states have call successors, (0), 0 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-03 10:47:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2058 transitions. [2025-03-03 10:47:29,633 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2058 transitions. Word has length 236 [2025-03-03 10:47:29,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:29,634 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2058 transitions. [2025-03-03 10:47:29,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-03 10:47:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2058 transitions. [2025-03-03 10:47:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-03 10:47:29,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:29,637 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 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] [2025-03-03 10:47:29,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:47:29,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:29,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash -825835076, now seen corresponding path program 1 times [2025-03-03 10:47:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764079341] [2025-03-03 10:47:29,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:29,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-03 10:47:29,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-03 10:47:29,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:29,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-03-03 10:47:29,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:29,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764079341] [2025-03-03 10:47:29,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764079341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:29,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:29,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:29,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867961235] [2025-03-03 10:47:29,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:29,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:29,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:29,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:29,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:47:29,900 INFO L87 Difference]: Start difference. First operand 1784 states and 2058 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-03 10:47:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:30,416 INFO L93 Difference]: Finished difference Result 3417 states and 4000 transitions. [2025-03-03 10:47:30,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:30,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 353 [2025-03-03 10:47:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:30,422 INFO L225 Difference]: With dead ends: 3417 [2025-03-03 10:47:30,422 INFO L226 Difference]: Without dead ends: 1962 [2025-03-03 10:47:30,423 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-03 10:47:30,424 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:30,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:47:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-03-03 10:47:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2025-03-03 10:47:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1099270891755468) internal successors, (1979), 1783 states have internal predecessors, (1979), 0 states have call successors, (0), 0 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-03 10:47:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1979 transitions. [2025-03-03 10:47:30,451 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1979 transitions. Word has length 353 [2025-03-03 10:47:30,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:30,452 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 1979 transitions. [2025-03-03 10:47:30,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-03 10:47:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1979 transitions. [2025-03-03 10:47:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-03 10:47:30,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:30,459 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-03 10:47:30,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:47:30,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:30,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:30,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2086783488, now seen corresponding path program 1 times [2025-03-03 10:47:30,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587181917] [2025-03-03 10:47:30,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:30,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-03 10:47:30,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-03 10:47:30,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:30,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-03 10:47:30,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587181917] [2025-03-03 10:47:30,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587181917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324928443] [2025-03-03 10:47:30,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:30,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:30,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:30,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:47:30,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:47:30,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-03 10:47:30,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-03 10:47:30,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:30,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:30,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:30,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2025-03-03 10:47:31,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324928443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:31,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:31,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:47:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996934445] [2025-03-03 10:47:31,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:31,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:31,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:31,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:31,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:47:31,398 INFO L87 Difference]: Start difference. First operand 1784 states and 1979 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 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-03 10:47:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:31,756 INFO L93 Difference]: Finished difference Result 2498 states and 2748 transitions. [2025-03-03 10:47:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:31,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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 442 [2025-03-03 10:47:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:31,764 INFO L225 Difference]: With dead ends: 2498 [2025-03-03 10:47:31,764 INFO L226 Difference]: Without dead ends: 2496 [2025-03-03 10:47:31,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:47:31,766 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:31,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:47:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-03-03 10:47:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1606. [2025-03-03 10:47:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.0859813084112149) internal successors, (1743), 1605 states have internal predecessors, (1743), 0 states have call successors, (0), 0 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-03 10:47:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1743 transitions. [2025-03-03 10:47:31,795 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1743 transitions. Word has length 442 [2025-03-03 10:47:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:31,796 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1743 transitions. [2025-03-03 10:47:31,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 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-03 10:47:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1743 transitions. [2025-03-03 10:47:31,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-03 10:47:31,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:31,801 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:47:31,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:32,001 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,SelfDestructingSolverStorable5 [2025-03-03 10:47:32,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:32,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1834281500, now seen corresponding path program 1 times [2025-03-03 10:47:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:32,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95181299] [2025-03-03 10:47:32,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:32,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:32,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-03 10:47:32,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-03 10:47:32,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:32,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:32,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:32,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95181299] [2025-03-03 10:47:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95181299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:32,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626518627] [2025-03-03 10:47:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:32,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:32,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:32,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:32,367 INFO L87 Difference]: Start difference. First operand 1606 states and 1743 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 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-03 10:47:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:32,772 INFO L93 Difference]: Finished difference Result 3566 states and 3923 transitions. [2025-03-03 10:47:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:32,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 448 [2025-03-03 10:47:32,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:32,779 INFO L225 Difference]: With dead ends: 3566 [2025-03-03 10:47:32,779 INFO L226 Difference]: Without dead ends: 2140 [2025-03-03 10:47:32,781 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-03 10:47:32,781 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:32,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-03-03 10:47:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1784. [2025-03-03 10:47:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.0779584969153113) internal successors, (1922), 1783 states have internal predecessors, (1922), 0 states have call successors, (0), 0 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-03 10:47:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1922 transitions. [2025-03-03 10:47:32,810 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1922 transitions. Word has length 448 [2025-03-03 10:47:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:32,811 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 1922 transitions. [2025-03-03 10:47:32,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 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-03 10:47:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1922 transitions. [2025-03-03 10:47:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-03 10:47:32,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:32,816 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:32,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:47:32,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:32,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1219163251, now seen corresponding path program 1 times [2025-03-03 10:47:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258293025] [2025-03-03 10:47:32,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:32,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-03 10:47:32,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-03 10:47:32,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:32,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:33,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:33,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258293025] [2025-03-03 10:47:33,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258293025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:33,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:33,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084667468] [2025-03-03 10:47:33,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:33,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:33,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:33,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:33,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:33,088 INFO L87 Difference]: Start difference. First operand 1784 states and 1922 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-03 10:47:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:33,495 INFO L93 Difference]: Finished difference Result 3744 states and 4100 transitions. [2025-03-03 10:47:33,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:33,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 455 [2025-03-03 10:47:33,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:33,501 INFO L225 Difference]: With dead ends: 3744 [2025-03-03 10:47:33,501 INFO L226 Difference]: Without dead ends: 2140 [2025-03-03 10:47:33,502 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-03 10:47:33,503 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:33,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-03-03 10:47:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2025-03-03 10:47:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.0882202957674656) internal successors, (2134), 1961 states have internal predecessors, (2134), 0 states have call successors, (0), 0 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-03 10:47:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2134 transitions. [2025-03-03 10:47:33,527 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2134 transitions. Word has length 455 [2025-03-03 10:47:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:33,527 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2134 transitions. [2025-03-03 10:47:33,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-03 10:47:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2134 transitions. [2025-03-03 10:47:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-03 10:47:33,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:33,530 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:33,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:47:33,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:33,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:33,531 INFO L85 PathProgramCache]: Analyzing trace with hash -394376232, now seen corresponding path program 1 times [2025-03-03 10:47:33,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:33,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614149378] [2025-03-03 10:47:33,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:33,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:33,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-03 10:47:33,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-03 10:47:33,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:33,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:33,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:33,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614149378] [2025-03-03 10:47:33,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614149378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:33,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:33,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:33,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713667678] [2025-03-03 10:47:33,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:33,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:33,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:33,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:33,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:33,719 INFO L87 Difference]: Start difference. First operand 1962 states and 2134 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:47:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:34,123 INFO L93 Difference]: Finished difference Result 4634 states and 5096 transitions. [2025-03-03 10:47:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 496 [2025-03-03 10:47:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:34,131 INFO L225 Difference]: With dead ends: 4634 [2025-03-03 10:47:34,131 INFO L226 Difference]: Without dead ends: 2852 [2025-03-03 10:47:34,133 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-03 10:47:34,134 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:34,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-03-03 10:47:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2025-03-03 10:47:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.0827779726411786) internal successors, (3087), 2851 states have internal predecessors, (3087), 0 states have call successors, (0), 0 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-03 10:47:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3087 transitions. [2025-03-03 10:47:34,169 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3087 transitions. Word has length 496 [2025-03-03 10:47:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:34,170 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3087 transitions. [2025-03-03 10:47:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:47:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3087 transitions. [2025-03-03 10:47:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-03 10:47:34,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:34,173 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:34,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:47:34,173 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:34,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash -847427712, now seen corresponding path program 1 times [2025-03-03 10:47:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:34,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867769898] [2025-03-03 10:47:34,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:34,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 10:47:34,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 10:47:34,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:34,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:34,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:34,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867769898] [2025-03-03 10:47:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867769898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:34,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:47:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314149313] [2025-03-03 10:47:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:34,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:34,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:34,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:47:34,473 INFO L87 Difference]: Start difference. First operand 2852 states and 3087 transitions. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 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-03 10:47:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:35,082 INFO L93 Difference]: Finished difference Result 5880 states and 6375 transitions. [2025-03-03 10:47:35,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:35,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 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 532 [2025-03-03 10:47:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:35,089 INFO L225 Difference]: With dead ends: 5880 [2025-03-03 10:47:35,090 INFO L226 Difference]: Without dead ends: 3208 [2025-03-03 10:47:35,092 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-03 10:47:35,093 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 214 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:35,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 68 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:47:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-03-03 10:47:35,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2025-03-03 10:47:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 3029 states have (on average 1.0762627930009905) internal successors, (3260), 3029 states have internal predecessors, (3260), 0 states have call successors, (0), 0 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-03 10:47:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3260 transitions. [2025-03-03 10:47:35,135 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3260 transitions. Word has length 532 [2025-03-03 10:47:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:35,135 INFO L471 AbstractCegarLoop]: Abstraction has 3030 states and 3260 transitions. [2025-03-03 10:47:35,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 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-03 10:47:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3260 transitions. [2025-03-03 10:47:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2025-03-03 10:47:35,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:35,139 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:47:35,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:47:35,139 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:35,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash 784335107, now seen corresponding path program 1 times [2025-03-03 10:47:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:35,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527521608] [2025-03-03 10:47:35,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:35,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:35,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-03-03 10:47:35,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-03-03 10:47:35,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:35,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-03 10:47:35,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527521608] [2025-03-03 10:47:35,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527521608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:35,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:35,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812476852] [2025-03-03 10:47:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:35,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:35,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:35,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:35,459 INFO L87 Difference]: Start difference. First operand 3030 states and 3260 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:47:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:35,864 INFO L93 Difference]: Finished difference Result 6236 states and 6776 transitions. [2025-03-03 10:47:35,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:35,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 610 [2025-03-03 10:47:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:35,872 INFO L225 Difference]: With dead ends: 6236 [2025-03-03 10:47:35,872 INFO L226 Difference]: Without dead ends: 3386 [2025-03-03 10:47:35,874 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-03 10:47:35,876 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:35,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 227 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-03-03 10:47:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3386. [2025-03-03 10:47:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.0709010339734122) internal successors, (3625), 3385 states have internal predecessors, (3625), 0 states have call successors, (0), 0 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-03 10:47:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3625 transitions. [2025-03-03 10:47:35,913 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3625 transitions. Word has length 610 [2025-03-03 10:47:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:35,914 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3625 transitions. [2025-03-03 10:47:35,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:47:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3625 transitions. [2025-03-03 10:47:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-03 10:47:35,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:35,917 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 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, 1, 1, 1, 1, 1, 1, 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-03 10:47:35,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:47:35,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:35,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:35,918 INFO L85 PathProgramCache]: Analyzing trace with hash 91529544, now seen corresponding path program 1 times [2025-03-03 10:47:35,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:35,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438969969] [2025-03-03 10:47:35,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:35,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:35,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-03 10:47:35,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-03 10:47:35,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:35,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1366 backedges. 942 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:36,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:36,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438969969] [2025-03-03 10:47:36,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438969969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:36,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258366970] [2025-03-03 10:47:36,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:36,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:36,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:36,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:47:36,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:47:36,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-03 10:47:36,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-03 10:47:36,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:36,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:36,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:36,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1366 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2025-03-03 10:47:36,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:36,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258366970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:36,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:36,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:47:36,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219661336] [2025-03-03 10:47:36,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:36,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:36,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:36,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:47:36,454 INFO L87 Difference]: Start difference. First operand 3386 states and 3625 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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-03 10:47:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:36,791 INFO L93 Difference]: Finished difference Result 8016 states and 8583 transitions. [2025-03-03 10:47:36,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:36,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 651 [2025-03-03 10:47:36,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:36,801 INFO L225 Difference]: With dead ends: 8016 [2025-03-03 10:47:36,801 INFO L226 Difference]: Without dead ends: 3920 [2025-03-03 10:47:36,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 651 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-03 10:47:36,805 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 119 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:36,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 241 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:47:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2025-03-03 10:47:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3564. [2025-03-03 10:47:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.0645523435307325) internal successors, (3793), 3563 states have internal predecessors, (3793), 0 states have call successors, (0), 0 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-03 10:47:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3793 transitions. [2025-03-03 10:47:36,846 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3793 transitions. Word has length 651 [2025-03-03 10:47:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:36,846 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3793 transitions. [2025-03-03 10:47:36,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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-03 10:47:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3793 transitions. [2025-03-03 10:47:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2025-03-03 10:47:36,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:36,850 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-03 10:47:36,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:37,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:37,055 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:37,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1307110560, now seen corresponding path program 1 times [2025-03-03 10:47:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:37,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269407172] [2025-03-03 10:47:37,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:37,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 742 statements into 1 equivalence classes. [2025-03-03 10:47:37,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 742 of 742 statements. [2025-03-03 10:47:37,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:37,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1880 backedges. 1396 proven. 110 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2025-03-03 10:47:37,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:37,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269407172] [2025-03-03 10:47:37,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269407172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:37,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743456877] [2025-03-03 10:47:37,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:37,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:37,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:37,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:47:37,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:47:37,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 742 statements into 1 equivalence classes. [2025-03-03 10:47:37,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 742 of 742 statements. [2025-03-03 10:47:37,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:37,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:37,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:37,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1880 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2025-03-03 10:47:37,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:37,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743456877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:37,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:47:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959368508] [2025-03-03 10:47:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:37,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:37,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:37,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:47:37,591 INFO L87 Difference]: Start difference. First operand 3564 states and 3793 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-03 10:47:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:37,953 INFO L93 Difference]: Finished difference Result 4456 states and 4730 transitions. [2025-03-03 10:47:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:37,953 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 742 [2025-03-03 10:47:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:37,963 INFO L225 Difference]: With dead ends: 4456 [2025-03-03 10:47:37,963 INFO L226 Difference]: Without dead ends: 4454 [2025-03-03 10:47:37,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 742 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-03 10:47:37,964 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 140 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:37,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 16 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:47:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-03-03 10:47:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3564. [2025-03-03 10:47:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.0639910188043784) internal successors, (3791), 3563 states have internal predecessors, (3791), 0 states have call successors, (0), 0 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-03 10:47:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3791 transitions. [2025-03-03 10:47:38,001 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3791 transitions. Word has length 742 [2025-03-03 10:47:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:38,001 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3791 transitions. [2025-03-03 10:47:38,002 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-03 10:47:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3791 transitions. [2025-03-03 10:47:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-03 10:47:38,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:38,008 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:47:38,015 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-03 10:47:38,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:38,208 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:38,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1726661175, now seen corresponding path program 1 times [2025-03-03 10:47:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400925041] [2025-03-03 10:47:38,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:38,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-03 10:47:38,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-03 10:47:38,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:38,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2439 backedges. 1825 proven. 110 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-03 10:47:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400925041] [2025-03-03 10:47:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400925041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509763517] [2025-03-03 10:47:38,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:38,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:38,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:38,522 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-03 10:47:38,524 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-03 10:47:38,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-03 10:47:38,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-03 10:47:38,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:38,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:38,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:47:38,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2439 backedges. 1825 proven. 110 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-03 10:47:38,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:47:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2439 backedges. 1825 proven. 110 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-03 10:47:39,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509763517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:47:39,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:47:39,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 10:47:39,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037172165] [2025-03-03 10:47:39,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:47:39,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:47:39,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:39,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:47:39,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:47:39,156 INFO L87 Difference]: Start difference. First operand 3564 states and 3791 transitions. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 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-03 10:47:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:39,820 INFO L93 Difference]: Finished difference Result 8550 states and 9096 transitions. [2025-03-03 10:47:39,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:47:39,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 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 829 [2025-03-03 10:47:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:39,828 INFO L225 Difference]: With dead ends: 8550 [2025-03-03 10:47:39,828 INFO L226 Difference]: Without dead ends: 5166 [2025-03-03 10:47:39,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1660 GetRequests, 1656 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-03 10:47:39,832 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 227 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:39,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 62 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:47:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-03-03 10:47:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4276. [2025-03-03 10:47:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0617543859649123) internal successors, (4539), 4275 states have internal predecessors, (4539), 0 states have call successors, (0), 0 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-03 10:47:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4539 transitions. [2025-03-03 10:47:39,888 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4539 transitions. Word has length 829 [2025-03-03 10:47:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:39,889 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4539 transitions. [2025-03-03 10:47:39,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 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-03 10:47:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4539 transitions. [2025-03-03 10:47:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2025-03-03 10:47:39,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:39,901 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, 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, 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, 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] [2025-03-03 10:47:39,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:40,101 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,SelfDestructingSolverStorable13 [2025-03-03 10:47:40,101 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:40,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:40,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2063887242, now seen corresponding path program 1 times [2025-03-03 10:47:40,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:40,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967853072] [2025-03-03 10:47:40,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:40,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:40,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 888 statements into 1 equivalence classes. [2025-03-03 10:47:40,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 888 of 888 statements. [2025-03-03 10:47:40,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:40,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2487 backedges. 977 proven. 325 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2025-03-03 10:47:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:40,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967853072] [2025-03-03 10:47:40,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967853072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:40,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661818028] [2025-03-03 10:47:40,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:40,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:40,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:40,913 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-03 10:47:40,915 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-03 10:47:40,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 888 statements into 1 equivalence classes. [2025-03-03 10:47:41,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 888 of 888 statements. [2025-03-03 10:47:41,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:41,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:41,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:47:41,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2487 backedges. 1168 proven. 0 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked. [2025-03-03 10:47:42,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:42,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661818028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:42,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:42,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:47:42,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561625933] [2025-03-03 10:47:42,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:42,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:42,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:42,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:47:42,931 INFO L87 Difference]: Start difference. First operand 4276 states and 4539 transitions. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 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-03 10:47:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:43,314 INFO L93 Difference]: Finished difference Result 8579 states and 9109 transitions. [2025-03-03 10:47:43,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:43,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 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 888 [2025-03-03 10:47:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:43,320 INFO L225 Difference]: With dead ends: 8579 [2025-03-03 10:47:43,320 INFO L226 Difference]: Without dead ends: 4276 [2025-03-03 10:47:43,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 886 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:47:43,323 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 102 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:43,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 46 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2025-03-03 10:47:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2025-03-03 10:47:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0449122807017543) internal successors, (4467), 4275 states have internal predecessors, (4467), 0 states have call successors, (0), 0 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-03 10:47:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4467 transitions. [2025-03-03 10:47:43,352 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4467 transitions. Word has length 888 [2025-03-03 10:47:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:43,353 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4467 transitions. [2025-03-03 10:47:43,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 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-03 10:47:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4467 transitions. [2025-03-03 10:47:43,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2025-03-03 10:47:43,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:43,359 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, 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, 8, 8, 7, 7, 7, 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, 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, 1] [2025-03-03 10:47:43,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 10:47:43,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 10:47:43,564 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:43,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1055358609, now seen corresponding path program 1 times [2025-03-03 10:47:43,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:43,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68805277] [2025-03-03 10:47:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:43,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1028 statements into 1 equivalence classes. [2025-03-03 10:47:43,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1028 of 1028 statements. [2025-03-03 10:47:43,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:43,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3567 backedges. 1098 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2025-03-03 10:47:44,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:44,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68805277] [2025-03-03 10:47:44,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68805277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:44,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:44,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:44,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152169422] [2025-03-03 10:47:44,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:44,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:44,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:44,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:44,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:44,180 INFO L87 Difference]: Start difference. First operand 4276 states and 4467 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-03 10:47:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:44,531 INFO L93 Difference]: Finished difference Result 8372 states and 8753 transitions. [2025-03-03 10:47:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:44,531 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 1028 [2025-03-03 10:47:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:44,537 INFO L225 Difference]: With dead ends: 8372 [2025-03-03 10:47:44,538 INFO L226 Difference]: Without dead ends: 4276 [2025-03-03 10:47:44,541 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-03 10:47:44,542 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 111 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:44,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 227 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:47:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2025-03-03 10:47:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2025-03-03 10:47:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.040701754385965) internal successors, (4449), 4275 states have internal predecessors, (4449), 0 states have call successors, (0), 0 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-03 10:47:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4449 transitions. [2025-03-03 10:47:44,576 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4449 transitions. Word has length 1028 [2025-03-03 10:47:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:44,576 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4449 transitions. [2025-03-03 10:47:44,576 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-03 10:47:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4449 transitions. [2025-03-03 10:47:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2025-03-03 10:47:44,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:44,583 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 10:47:44,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:47:44,583 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:44,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash 29077785, now seen corresponding path program 1 times [2025-03-03 10:47:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:44,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015463233] [2025-03-03 10:47:44,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:44,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:44,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1076 statements into 1 equivalence classes. [2025-03-03 10:47:44,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1076 of 1076 statements. [2025-03-03 10:47:44,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:44,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3764 backedges. 2688 proven. 72 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2025-03-03 10:47:45,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015463233] [2025-03-03 10:47:45,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015463233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892199300] [2025-03-03 10:47:45,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:45,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:45,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:45,537 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-03 10:47:45,556 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-03 10:47:45,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1076 statements into 1 equivalence classes. [2025-03-03 10:47:45,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1076 of 1076 statements. [2025-03-03 10:47:45,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:45,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 10:47:45,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3764 backedges. 2647 proven. 666 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-03 10:47:46,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:47:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3764 backedges. 2760 proven. 0 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2025-03-03 10:47:46,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892199300] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:46,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:47:46,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-03-03 10:47:46,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029162378] [2025-03-03 10:47:46,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:46,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:47:46,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:46,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:47:46,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:47:46,734 INFO L87 Difference]: Start difference. First operand 4276 states and 4449 transitions. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-03 10:47:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:47,136 INFO L93 Difference]: Finished difference Result 8906 states and 9281 transitions. [2025-03-03 10:47:47,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:47,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 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-03 10:47:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:47,143 INFO L225 Difference]: With dead ends: 8906 [2025-03-03 10:47:47,144 INFO L226 Difference]: Without dead ends: 4810 [2025-03-03 10:47:47,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2155 GetRequests, 2147 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-03 10:47:47,148 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 128 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:47,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 9 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-03-03 10:47:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4276. [2025-03-03 10:47:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.040233918128655) internal successors, (4447), 4275 states have internal predecessors, (4447), 0 states have call successors, (0), 0 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-03 10:47:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4447 transitions. [2025-03-03 10:47:47,187 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4447 transitions. Word has length 1076 [2025-03-03 10:47:47,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:47,187 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4447 transitions. [2025-03-03 10:47:47,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-03 10:47:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4447 transitions. [2025-03-03 10:47:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1236 [2025-03-03 10:47:47,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:47,195 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:47,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:47,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:47,396 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:47,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash 388486813, now seen corresponding path program 1 times [2025-03-03 10:47:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584175881] [2025-03-03 10:47:47,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:47,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:47,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1235 statements into 1 equivalence classes. [2025-03-03 10:47:47,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1235 of 1235 statements. [2025-03-03 10:47:47,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:47,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4300 backedges. 3224 proven. 72 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2025-03-03 10:47:48,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:48,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584175881] [2025-03-03 10:47:48,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584175881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:48,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368636424] [2025-03-03 10:47:48,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:48,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:48,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:48,457 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-03 10:47:48,460 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-03 10:47:48,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1235 statements into 1 equivalence classes. [2025-03-03 10:47:48,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1235 of 1235 statements. [2025-03-03 10:47:48,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:48,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:48,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:47:48,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4300 backedges. 2937 proven. 0 refuted. 0 times theorem prover too weak. 1363 trivial. 0 not checked. [2025-03-03 10:47:49,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368636424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:49,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:49,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-03 10:47:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141552952] [2025-03-03 10:47:49,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:49,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:49,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:49,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:47:49,038 INFO L87 Difference]: Start difference. First operand 4276 states and 4447 transitions. Second operand has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 0 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-03 10:47:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:49,613 INFO L93 Difference]: Finished difference Result 9440 states and 9804 transitions. [2025-03-03 10:47:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:49,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 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 1235 [2025-03-03 10:47:49,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:49,623 INFO L225 Difference]: With dead ends: 9440 [2025-03-03 10:47:49,623 INFO L226 Difference]: Without dead ends: 5344 [2025-03-03 10:47:49,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1239 GetRequests, 1234 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-03 10:47:49,627 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:49,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 40 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:47:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2025-03-03 10:47:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4632. [2025-03-03 10:47:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.038436622759663) internal successors, (4809), 4631 states have internal predecessors, (4809), 0 states have call successors, (0), 0 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-03 10:47:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4809 transitions. [2025-03-03 10:47:49,667 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4809 transitions. Word has length 1235 [2025-03-03 10:47:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:49,668 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4809 transitions. [2025-03-03 10:47:49,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 0 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-03 10:47:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4809 transitions. [2025-03-03 10:47:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1238 [2025-03-03 10:47:49,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:49,692 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, 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, 8, 8, 8, 8, 8, 8, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:49,700 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-03 10:47:49,892 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,SelfDestructingSolverStorable17 [2025-03-03 10:47:49,893 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:49,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:49,893 INFO L85 PathProgramCache]: Analyzing trace with hash -561635589, now seen corresponding path program 1 times [2025-03-03 10:47:49,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:49,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209011558] [2025-03-03 10:47:49,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:49,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:49,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1237 statements into 1 equivalence classes. [2025-03-03 10:47:50,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1237 of 1237 statements. [2025-03-03 10:47:50,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:50,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4058 backedges. 2642 proven. 7 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2025-03-03 10:47:50,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:50,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209011558] [2025-03-03 10:47:50,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209011558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:50,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330442424] [2025-03-03 10:47:50,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:50,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:50,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:50,727 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-03 10:47:50,728 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-03 10:47:50,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1237 statements into 1 equivalence classes. [2025-03-03 10:47:50,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1237 of 1237 statements. [2025-03-03 10:47:50,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:50,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:50,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:50,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4058 backedges. 2649 proven. 0 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2025-03-03 10:47:51,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:51,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330442424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:51,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:51,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:47:51,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751102366] [2025-03-03 10:47:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:51,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:51,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:51,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:47:51,107 INFO L87 Difference]: Start difference. First operand 4632 states and 4809 transitions. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 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-03 10:47:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:51,399 INFO L93 Difference]: Finished difference Result 9618 states and 10031 transitions. [2025-03-03 10:47:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:51,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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 1237 [2025-03-03 10:47:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:51,409 INFO L225 Difference]: With dead ends: 9618 [2025-03-03 10:47:51,409 INFO L226 Difference]: Without dead ends: 5166 [2025-03-03 10:47:51,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1240 GetRequests, 1236 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-03 10:47:51,413 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:51,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 218 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:47:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-03-03 10:47:51,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4988. [2025-03-03 10:47:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0368959294164828) internal successors, (5171), 4987 states have internal predecessors, (5171), 0 states have call successors, (0), 0 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-03 10:47:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5171 transitions. [2025-03-03 10:47:51,461 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5171 transitions. Word has length 1237 [2025-03-03 10:47:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:51,462 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5171 transitions. [2025-03-03 10:47:51,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 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-03 10:47:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5171 transitions. [2025-03-03 10:47:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1367 [2025-03-03 10:47:51,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:51,472 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, 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, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:51,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:51,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:51,676 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:51,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:51,677 INFO L85 PathProgramCache]: Analyzing trace with hash -229966236, now seen corresponding path program 1 times [2025-03-03 10:47:51,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:51,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992307399] [2025-03-03 10:47:51,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:51,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1366 statements into 1 equivalence classes. [2025-03-03 10:47:51,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1366 of 1366 statements. [2025-03-03 10:47:51,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:51,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5086 backedges. 3185 proven. 495 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2025-03-03 10:47:53,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:53,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992307399] [2025-03-03 10:47:53,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992307399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:53,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089535075] [2025-03-03 10:47:53,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:53,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:53,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:53,075 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-03 10:47:53,076 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-03 10:47:53,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1366 statements into 1 equivalence classes. [2025-03-03 10:47:53,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1366 of 1366 statements. [2025-03-03 10:47:53,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:53,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:53,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:47:53,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5086 backedges. 3268 proven. 0 refuted. 0 times theorem prover too weak. 1818 trivial. 0 not checked. [2025-03-03 10:47:54,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:54,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089535075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:54,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:54,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-03 10:47:54,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400440043] [2025-03-03 10:47:54,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:54,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:54,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:54,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:54,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:47:54,015 INFO L87 Difference]: Start difference. First operand 4988 states and 5171 transitions. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 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-03 10:47:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:54,462 INFO L93 Difference]: Finished difference Result 9796 states and 10161 transitions. [2025-03-03 10:47:54,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:54,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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 1366 [2025-03-03 10:47:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:54,468 INFO L225 Difference]: With dead ends: 9796 [2025-03-03 10:47:54,468 INFO L226 Difference]: Without dead ends: 4810 [2025-03-03 10:47:54,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1372 GetRequests, 1365 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:47:54,474 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:54,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 47 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-03-03 10:47:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2025-03-03 10:47:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0363901018922852) internal successors, (4984), 4809 states have internal predecessors, (4984), 0 states have call successors, (0), 0 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-03 10:47:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4984 transitions. [2025-03-03 10:47:54,540 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4984 transitions. Word has length 1366 [2025-03-03 10:47:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:54,541 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 4984 transitions. [2025-03-03 10:47:54,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 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-03 10:47:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4984 transitions. [2025-03-03 10:47:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1396 [2025-03-03 10:47:54,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:54,561 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, 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, 9, 9, 9, 9, 9, 9, 8, 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, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:54,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:54,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:54,762 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:54,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash 925989351, now seen corresponding path program 1 times [2025-03-03 10:47:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:54,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117053930] [2025-03-03 10:47:54,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:54,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:54,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1395 statements into 1 equivalence classes. [2025-03-03 10:47:54,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1395 of 1395 statements. [2025-03-03 10:47:54,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:54,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5228 backedges. 3088 proven. 95 refuted. 0 times theorem prover too weak. 2045 trivial. 0 not checked. [2025-03-03 10:47:55,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:55,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117053930] [2025-03-03 10:47:55,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117053930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:55,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133692994] [2025-03-03 10:47:55,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:55,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:55,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:55,668 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-03 10:47:55,669 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-03 10:47:55,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1395 statements into 1 equivalence classes. [2025-03-03 10:47:55,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1395 of 1395 statements. [2025-03-03 10:47:55,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:55,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:55,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:55,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5228 backedges. 3183 proven. 0 refuted. 0 times theorem prover too weak. 2045 trivial. 0 not checked. [2025-03-03 10:47:56,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:56,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133692994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:56,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:56,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:47:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191005031] [2025-03-03 10:47:56,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:56,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:56,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:56,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:56,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:47:56,092 INFO L87 Difference]: Start difference. First operand 4810 states and 4984 transitions. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 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-03 10:47:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:56,412 INFO L93 Difference]: Finished difference Result 9440 states and 9787 transitions. [2025-03-03 10:47:56,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:56,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 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 1395 [2025-03-03 10:47:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:56,418 INFO L225 Difference]: With dead ends: 9440 [2025-03-03 10:47:56,419 INFO L226 Difference]: Without dead ends: 4810 [2025-03-03 10:47:56,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1398 GetRequests, 1394 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-03 10:47:56,422 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:56,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 222 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:47:56,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-03-03 10:47:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2025-03-03 10:47:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0295279683925973) internal successors, (4951), 4809 states have internal predecessors, (4951), 0 states have call successors, (0), 0 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-03 10:47:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4951 transitions. [2025-03-03 10:47:56,459 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4951 transitions. Word has length 1395 [2025-03-03 10:47:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:56,460 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 4951 transitions. [2025-03-03 10:47:56,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 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-03 10:47:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4951 transitions. [2025-03-03 10:47:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1486 [2025-03-03 10:47:56,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:56,470 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, 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, 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, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:56,478 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-03 10:47:56,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-03 10:47:56,671 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:56,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:56,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1300447894, now seen corresponding path program 1 times [2025-03-03 10:47:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:56,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727341484] [2025-03-03 10:47:56,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:56,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1485 statements into 1 equivalence classes. [2025-03-03 10:47:56,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1485 of 1485 statements. [2025-03-03 10:47:56,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:56,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6478 backedges. 2852 proven. 120 refuted. 0 times theorem prover too weak. 3506 trivial. 0 not checked. [2025-03-03 10:47:58,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:58,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727341484] [2025-03-03 10:47:58,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727341484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:58,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975387674] [2025-03-03 10:47:58,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:58,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:58,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:58,088 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-03 10:47:58,090 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-03 10:47:58,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1485 statements into 1 equivalence classes. [2025-03-03 10:47:58,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1485 of 1485 statements. [2025-03-03 10:47:58,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:58,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:58,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 1769 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:47:58,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6478 backedges. 1842 proven. 60 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2025-03-03 10:47:59,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:48:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6478 backedges. 1842 proven. 60 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2025-03-03 10:48:00,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975387674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:48:00,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:48:00,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2025-03-03 10:48:00,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159645796] [2025-03-03 10:48:00,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:48:00,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 10:48:00,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:00,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 10:48:00,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:48:00,830 INFO L87 Difference]: Start difference. First operand 4810 states and 4951 transitions. Second operand has 8 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-03 10:48:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:02,146 INFO L93 Difference]: Finished difference Result 12108 states and 12478 transitions. [2025-03-03 10:48:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 10:48:02,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 0 states have call successors, (0), 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 1485 [2025-03-03 10:48:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:02,147 INFO L225 Difference]: With dead ends: 12108 [2025-03-03 10:48:02,147 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:48:02,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2977 GetRequests, 2968 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:48:02,154 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 673 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:02,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 36 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:48:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:48:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:48:02,154 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-03 10:48:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:48:02,155 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1485 [2025-03-03 10:48:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:02,155 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:48:02,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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-03 10:48:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:48:02,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:48:02,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:48:02,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 10:48:02,363 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-03 10:48:02,366 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] [2025-03-03 10:48:02,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:48:03,123 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:48:03,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:48:03 BoogieIcfgContainer [2025-03-03 10:48:03,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:48:03,144 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:48:03,144 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:48:03,145 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:48:03,145 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:24" (3/4) ... [2025-03-03 10:48:03,151 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:48:03,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:48:03,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:48:03,173 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:48:03,174 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:48:03,296 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:48:03,296 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:48:03,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:48:03,297 INFO L158 Benchmark]: Toolchain (without parser) took 40312.06ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 121.7MB in the beginning and 169.3MB in the end (delta: -47.6MB). Peak memory consumption was 139.5MB. Max. memory is 16.1GB. [2025-03-03 10:48:03,297 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:48:03,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.02ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 90.2MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 10:48:03,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.44ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 81.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:48:03,297 INFO L158 Benchmark]: Boogie Preprocessor took 87.07ms. Allocated memory is still 167.8MB. Free memory was 81.1MB in the beginning and 69.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:48:03,297 INFO L158 Benchmark]: IcfgBuilder took 1071.47ms. Allocated memory is still 167.8MB. Free memory was 69.6MB in the beginning and 116.9MB in the end (delta: -47.3MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2025-03-03 10:48:03,297 INFO L158 Benchmark]: TraceAbstraction took 38486.99ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 115.9MB in the beginning and 58.9MB in the end (delta: 57.1MB). Peak memory consumption was 135.4MB. Max. memory is 16.1GB. [2025-03-03 10:48:03,297 INFO L158 Benchmark]: Witness Printer took 151.55ms. Allocated memory is still 226.5MB. Free memory was 58.9MB in the beginning and 169.3MB in the end (delta: -110.4MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2025-03-03 10:48:03,298 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.16ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.02ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 90.2MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.44ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 81.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.07ms. Allocated memory is still 167.8MB. Free memory was 81.1MB in the beginning and 69.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1071.47ms. Allocated memory is still 167.8MB. Free memory was 69.6MB in the beginning and 116.9MB in the end (delta: -47.3MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38486.99ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 115.9MB in the beginning and 58.9MB in the end (delta: 57.1MB). Peak memory consumption was 135.4MB. Max. memory is 16.1GB. * Witness Printer took 151.55ms. Allocated memory is still 226.5MB. Free memory was 58.9MB in the beginning and 169.3MB in the end (delta: -110.4MB). Peak memory consumption was 17.9MB. 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: 200]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.7s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3143 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3143 mSDsluCounter, 2441 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 1580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14229 IncrementalHoareTripleChecker+Invalid, 15809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1580 mSolverCounterUnsat, 2283 mSDtfsCounter, 14229 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15045 GetRequests, 14969 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=19, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 5342 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 27520 NumberOfCodeBlocks, 27520 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 30873 ConstructedInterpolants, 0 QuantifiedInterpolants, 92649 SizeOfPredicates, 1 NumberOfNonLiveVariables, 14018 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 37 InterpolantComputations, 20 PerfectInterpolantSequences, 94424/97182 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: ((((((((((((((((((a24 == 1) && (a21 == 9)) && (81 <= a12)) && (a12 <= 600060)) || ((((a12 <= 11) && (a24 == 1)) && (10 <= a21)) && (0 <= ((long long) a12 + 42)))) || (((((a12 <= 11) && (7 <= a15)) && (a24 == 1)) && (7 == a21)) && (a15 <= 8))) || ((((7 <= a15) && (a24 == 1)) && (10 <= a21)) && (a12 <= 600060))) || ((((a21 == 8) && (a24 == 1)) && (8 <= a15)) && (a12 <= 600060))) || ((((a24 == 1) && (a15 <= 8)) && (a21 == 9)) && (0 <= (43773 + (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) >= 0) ? ((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) : (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) - 1)))))) || (((a21 <= 6) && (a12 <= 10)) && (a15 <= 5))) || (((((a12 <= 73282) && (a24 == 1)) && (a15 <= 8)) && (a21 <= 6)) && (0 <= ((long long) a12 + 42)))) || ((((((7 <= a15) && (a24 == 1)) && (12849 <= a12)) && (a21 <= 6)) && ((0 < (43773 + (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) >= 0) ? ((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) : (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) - 1)))) || (((((((long long) a12 + 1) >= 0) ? (((long long) a12 + 1) % 9) : ((((long long) a12 + 1) % 9) + 9)) * 9) % 10) != 0))) && (0 <= (43773 + (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) >= 0) ? ((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) : (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) - 1)))))) || ((a24 == 1) && (a15 <= 5))) || ((((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) && (a21 <= 6)) && (0 <= ((long long) a12 + 42))) && (a12 <= 600060))) || ((((a21 == 8) && (a24 == 1)) && (12849 <= a12)) && (a12 <= 600060))) || ((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) && (((long long) 49 + a12) <= 0))) || (((a12 <= 80) && (a21 == 8)) && (a24 == 1))) || (((((a24 == 1) && (7 == a21)) && (0 <= ((long long) a12 + 42))) && (8 <= a15)) && (a12 <= 600060))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:48:03,318 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