./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i -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 6c4f2ab200ae95c9ca275594b018c3497d9548a4085e649d22d856974a67d096 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:59:47,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:59:47,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:59:47,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:59:47,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:59:47,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:59:47,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:59:47,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:59:47,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:59:47,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:59:47,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:59:47,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:59:47,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:59:47,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:59:47,312 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:59:47,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:59:47,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:59:47,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:59:47,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:59:47,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:59:47,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:59:47,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:59:47,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:59:47,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:59:47,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:59:47,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:59:47,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:59:47,314 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:59:47,314 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:59:47,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:59:47,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:59:47,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:59:47,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:59:47,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:59:47,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:59:47,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:59:47,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:59:47,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:59:47,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:59:47,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:59:47,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:59:47,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:59:47,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:59:47,316 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 -> 6c4f2ab200ae95c9ca275594b018c3497d9548a4085e649d22d856974a67d096 [2025-03-17 02:59:47,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:59:47,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:59:47,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:59:47,569 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:59:47,569 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:59:47,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i [2025-03-17 02:59:48,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca30983a/ae9209e69f7749d198fddc0a030231cd/FLAGbaeb04f1f [2025-03-17 02:59:48,940 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:59:48,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i [2025-03-17 02:59:48,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca30983a/ae9209e69f7749d198fddc0a030231cd/FLAGbaeb04f1f [2025-03-17 02:59:49,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca30983a/ae9209e69f7749d198fddc0a030231cd [2025-03-17 02:59:49,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:59:49,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:59:49,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:59:49,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:59:49,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:59:49,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49, skipping insertion in model container [2025-03-17 02:59:49,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:59:49,385 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i[916,929] [2025-03-17 02:59:49,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:59:49,429 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:59:49,438 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i[916,929] [2025-03-17 02:59:49,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:59:49,480 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:59:49,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49 WrapperNode [2025-03-17 02:59:49,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:59:49,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:59:49,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:59:49,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:59:49,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,530 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-17 02:59:49,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:59:49,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:59:49,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:59:49,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:59:49,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,562 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-17 02:59:49,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:59:49,583 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:59:49,583 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:59:49,583 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:59:49,583 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (1/1) ... [2025-03-17 02:59:49,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:59:49,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:59:49,612 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-17 02:59:49,615 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-17 02:59:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:59:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:59:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:59:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:59:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:59:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:59:49,693 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:59:49,695 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:59:49,968 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: havoc property_#t~ite14#1;havoc property_#t~ite13#1;havoc property_#t~ite12#1;havoc property_#t~bitwise11#1;havoc property_#t~short15#1; [2025-03-17 02:59:49,994 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 02:59:49,994 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:59:50,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:59:50,012 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:59:50,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:50 BoogieIcfgContainer [2025-03-17 02:59:50,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:59:50,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:59:50,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:59:50,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:59:50,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:59:49" (1/3) ... [2025-03-17 02:59:50,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a92d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:59:50, skipping insertion in model container [2025-03-17 02:59:50,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:49" (2/3) ... [2025-03-17 02:59:50,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a92d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:59:50, skipping insertion in model container [2025-03-17 02:59:50,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:50" (3/3) ... [2025-03-17 02:59:50,023 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-89.i [2025-03-17 02:59:50,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:59:50,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-89.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:59:50,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:59:50,097 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;@1a14665e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:59:50,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:59:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 02:59:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 02:59:50,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:50,110 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:59:50,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:50,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:50,115 INFO L85 PathProgramCache]: Analyzing trace with hash -277790731, now seen corresponding path program 1 times [2025-03-17 02:59:50,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:50,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037470415] [2025-03-17 02:59:50,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:50,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:50,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 02:59:50,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 02:59:50,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:50,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 02:59:50,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:50,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037470415] [2025-03-17 02:59:50,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037470415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:59:50,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127436292] [2025-03-17 02:59:50,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:50,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:59:50,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:59:50,325 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-17 02:59:50,327 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-17 02:59:50,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 02:59:50,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 02:59:50,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:50,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:50,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:59:50,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:59:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 02:59:50,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:59:50,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127436292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:50,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:59:50,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:59:50,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371812980] [2025-03-17 02:59:50,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:50,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:59:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:50,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:59:50,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:59:50,470 INFO L87 Difference]: Start difference. First operand has 58 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 02:59:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:50,492 INFO L93 Difference]: Finished difference Result 113 states and 187 transitions. [2025-03-17 02:59:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:59:50,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 84 [2025-03-17 02:59:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:50,502 INFO L225 Difference]: With dead ends: 113 [2025-03-17 02:59:50,502 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 02:59:50,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:59:50,506 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:50,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:59:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 02:59:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 02:59:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 02:59:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2025-03-17 02:59:50,565 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 84 [2025-03-17 02:59:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:50,565 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2025-03-17 02:59:50,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 02:59:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2025-03-17 02:59:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 02:59:50,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:50,569 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:59:50,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 02:59:50,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:59:50,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:50,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash 56342996, now seen corresponding path program 1 times [2025-03-17 02:59:50,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:50,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925952181] [2025-03-17 02:59:50,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:50,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:50,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 02:59:50,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 02:59:50,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:50,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 02:59:51,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:51,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925952181] [2025-03-17 02:59:51,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925952181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:51,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:51,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:59:51,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633230459] [2025-03-17 02:59:51,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:51,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:59:51,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:51,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:59:51,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:59:51,334 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:51,538 INFO L93 Difference]: Finished difference Result 167 states and 245 transitions. [2025-03-17 02:59:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:59:51,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2025-03-17 02:59:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:51,540 INFO L225 Difference]: With dead ends: 167 [2025-03-17 02:59:51,542 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 02:59:51,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:59:51,543 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 59 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:51,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 266 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:59:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 02:59:51,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2025-03-17 02:59:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 02:59:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2025-03-17 02:59:51,569 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 84 [2025-03-17 02:59:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:51,570 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2025-03-17 02:59:51,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2025-03-17 02:59:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 02:59:51,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:51,571 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:59:51,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:59:51,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:51,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:51,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1740608363, now seen corresponding path program 1 times [2025-03-17 02:59:51,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:51,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137005938] [2025-03-17 02:59:51,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:51,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 02:59:51,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 02:59:51,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:51,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 02:59:52,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:52,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137005938] [2025-03-17 02:59:52,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137005938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:52,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:52,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:59:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151460879] [2025-03-17 02:59:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:52,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:59:52,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:52,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:59:52,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:59:52,554 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:52,832 INFO L93 Difference]: Finished difference Result 196 states and 285 transitions. [2025-03-17 02:59:52,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:59:52,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2025-03-17 02:59:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:52,834 INFO L225 Difference]: With dead ends: 196 [2025-03-17 02:59:52,834 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 02:59:52,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:59:52,835 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 78 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:52,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 365 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:59:52,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 02:59:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2025-03-17 02:59:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 02:59:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2025-03-17 02:59:52,858 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 84 [2025-03-17 02:59:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:52,859 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2025-03-17 02:59:52,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2025-03-17 02:59:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 02:59:52,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:52,862 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:59:52,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:59:52,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:52,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash 746904470, now seen corresponding path program 1 times [2025-03-17 02:59:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:52,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357143043] [2025-03-17 02:59:52,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:52,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 02:59:52,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 02:59:52,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:52,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 02:59:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:53,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357143043] [2025-03-17 02:59:53,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357143043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:53,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:53,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:59:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536229279] [2025-03-17 02:59:53,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:53,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:59:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:53,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:59:53,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:59:53,313 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:53,573 INFO L93 Difference]: Finished difference Result 209 states and 304 transitions. [2025-03-17 02:59:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:59:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2025-03-17 02:59:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:53,575 INFO L225 Difference]: With dead ends: 209 [2025-03-17 02:59:53,575 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 02:59:53,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:59:53,576 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 77 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:53,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 572 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:59:53,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 02:59:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2025-03-17 02:59:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 02:59:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2025-03-17 02:59:53,592 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 84 [2025-03-17 02:59:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:53,593 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2025-03-17 02:59:53,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2025-03-17 02:59:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:59:53,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:53,594 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:59:53,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:59:53,595 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:53,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1915646532, now seen corresponding path program 1 times [2025-03-17 02:59:53,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:53,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711101529] [2025-03-17 02:59:53,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:53,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:53,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:59:53,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:59:53,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:53,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-17 02:59:54,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:54,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711101529] [2025-03-17 02:59:54,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711101529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:59:54,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857365123] [2025-03-17 02:59:54,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:54,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:59:54,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:59:54,202 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-17 02:59:54,203 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-17 02:59:54,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:59:54,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:59:54,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:54,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:54,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 02:59:54,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:59:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 02:59:54,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:59:54,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857365123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:54,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:59:54,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-17 02:59:54,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999798975] [2025-03-17 02:59:54,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:54,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:59:54,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:54,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:59:54,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-17 02:59:54,585 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:54,895 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2025-03-17 02:59:54,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:59:54,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2025-03-17 02:59:54,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:54,899 INFO L225 Difference]: With dead ends: 222 [2025-03-17 02:59:54,899 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 02:59:54,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-03-17 02:59:54,901 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 101 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:54,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 433 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:59:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 02:59:54,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-03-17 02:59:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 108 states have internal predecessors, (138), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 02:59:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 216 transitions. [2025-03-17 02:59:54,924 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 216 transitions. Word has length 86 [2025-03-17 02:59:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:54,924 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 216 transitions. [2025-03-17 02:59:54,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 216 transitions. [2025-03-17 02:59:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:59:54,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:54,926 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:59:54,932 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-17 02:59:55,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:59:55,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:55,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash -260588400, now seen corresponding path program 1 times [2025-03-17 02:59:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:55,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300347062] [2025-03-17 02:59:55,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:55,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:55,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:59:55,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:59:55,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:55,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 02:59:55,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:55,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300347062] [2025-03-17 02:59:55,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300347062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:55,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:55,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:59:55,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776686952] [2025-03-17 02:59:55,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:55,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:59:55,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:55,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:59:55,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:59:55,215 INFO L87 Difference]: Start difference. First operand 151 states and 216 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:55,268 INFO L93 Difference]: Finished difference Result 294 states and 415 transitions. [2025-03-17 02:59:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:59:55,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2025-03-17 02:59:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:55,270 INFO L225 Difference]: With dead ends: 294 [2025-03-17 02:59:55,270 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 02:59:55,271 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-17 02:59:55,271 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 9 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:55,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:59:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 02:59:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 159. [2025-03-17 02:59:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 116 states have (on average 1.2672413793103448) internal successors, (147), 116 states have internal predecessors, (147), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 02:59:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 225 transitions. [2025-03-17 02:59:55,290 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 225 transitions. Word has length 88 [2025-03-17 02:59:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:55,290 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 225 transitions. [2025-03-17 02:59:55,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 225 transitions. [2025-03-17 02:59:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 02:59:55,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:55,291 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:59:55,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:59:55,291 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:55,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1589631575, now seen corresponding path program 1 times [2025-03-17 02:59:55,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:55,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685058724] [2025-03-17 02:59:55,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:55,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:55,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:59:55,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:59:55,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:55,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-17 02:59:55,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685058724] [2025-03-17 02:59:55,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685058724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:59:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211671016] [2025-03-17 02:59:55,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:55,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:59:55,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:59:55,966 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-17 02:59:55,976 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-17 02:59:56,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:59:56,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:59:56,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:56,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:56,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 02:59:56,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:59:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 96 proven. 30 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-17 02:59:56,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:59:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 02:59:56,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211671016] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 02:59:56,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 02:59:56,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 12] total 26 [2025-03-17 02:59:56,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520207750] [2025-03-17 02:59:56,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:56,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:59:56,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:56,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:59:56,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2025-03-17 02:59:56,859 INFO L87 Difference]: Start difference. First operand 159 states and 225 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:57,093 INFO L93 Difference]: Finished difference Result 172 states and 239 transitions. [2025-03-17 02:59:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:59:57,093 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2025-03-17 02:59:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:57,095 INFO L225 Difference]: With dead ends: 172 [2025-03-17 02:59:57,095 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 02:59:57,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 164 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2025-03-17 02:59:57,096 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 110 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:57,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 351 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:59:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 02:59:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2025-03-17 02:59:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 122 states have internal predecessors, (153), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 02:59:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 231 transitions. [2025-03-17 02:59:57,113 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 231 transitions. Word has length 89 [2025-03-17 02:59:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:57,115 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 231 transitions. [2025-03-17 02:59:57,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 231 transitions. [2025-03-17 02:59:57,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 02:59:57,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:57,117 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:59:57,124 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-17 02:59:57,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:59:57,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:57,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:57,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2017895480, now seen corresponding path program 1 times [2025-03-17 02:59:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:57,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384588570] [2025-03-17 02:59:57,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:57,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 02:59:57,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 02:59:57,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:57,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 02:59:57,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:57,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384588570] [2025-03-17 02:59:57,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384588570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:57,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:57,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:59:57,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60779270] [2025-03-17 02:59:57,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:57,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:59:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:57,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:59:57,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:59:57,361 INFO L87 Difference]: Start difference. First operand 165 states and 231 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:57,396 INFO L93 Difference]: Finished difference Result 363 states and 499 transitions. [2025-03-17 02:59:57,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:59:57,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-17 02:59:57,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:57,398 INFO L225 Difference]: With dead ends: 363 [2025-03-17 02:59:57,398 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 02:59:57,399 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-17 02:59:57,399 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 31 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:57,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 155 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:59:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 02:59:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2025-03-17 02:59:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 160 states have (on average 1.21875) internal successors, (195), 162 states have internal predecessors, (195), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-17 02:59:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 301 transitions. [2025-03-17 02:59:57,413 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 301 transitions. Word has length 96 [2025-03-17 02:59:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:57,414 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 301 transitions. [2025-03-17 02:59:57,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 301 transitions. [2025-03-17 02:59:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 02:59:57,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:57,415 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:59:57,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:59:57,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:57,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1882121755, now seen corresponding path program 1 times [2025-03-17 02:59:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404410376] [2025-03-17 02:59:57,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:57,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 02:59:57,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 02:59:57,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:57,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 02:59:58,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404410376] [2025-03-17 02:59:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404410376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:58,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:58,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 02:59:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406349865] [2025-03-17 02:59:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:58,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 02:59:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:58,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 02:59:58,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 02:59:58,304 INFO L87 Difference]: Start difference. First operand 220 states and 301 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:59,034 INFO L93 Difference]: Finished difference Result 254 states and 336 transitions. [2025-03-17 02:59:59,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 02:59:59,035 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 102 [2025-03-17 02:59:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:59,038 INFO L225 Difference]: With dead ends: 254 [2025-03-17 02:59:59,038 INFO L226 Difference]: Without dead ends: 252 [2025-03-17 02:59:59,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2025-03-17 02:59:59,039 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 141 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:59,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 455 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:59:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-17 02:59:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 232. [2025-03-17 02:59:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 172 states have (on average 1.2151162790697674) internal successors, (209), 174 states have internal predecessors, (209), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-17 02:59:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 315 transitions. [2025-03-17 02:59:59,055 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 315 transitions. Word has length 102 [2025-03-17 02:59:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:59,056 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 315 transitions. [2025-03-17 02:59:59,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 315 transitions. [2025-03-17 02:59:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 02:59:59,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:59,057 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:59:59,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:59:59,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:59,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:59,058 INFO L85 PathProgramCache]: Analyzing trace with hash -885049402, now seen corresponding path program 1 times [2025-03-17 02:59:59,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:59,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887102214] [2025-03-17 02:59:59,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:59,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:59,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 02:59:59,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 02:59:59,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:59,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:59:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 02:59:59,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:59:59,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887102214] [2025-03-17 02:59:59,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887102214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:59:59,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:59:59,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:59:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762826673] [2025-03-17 02:59:59,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:59:59,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:59:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:59:59,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:59:59,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:59:59,116 INFO L87 Difference]: Start difference. First operand 232 states and 315 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:59:59,183 INFO L93 Difference]: Finished difference Result 418 states and 570 transitions. [2025-03-17 02:59:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:59:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 102 [2025-03-17 02:59:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:59:59,185 INFO L225 Difference]: With dead ends: 418 [2025-03-17 02:59:59,185 INFO L226 Difference]: Without dead ends: 216 [2025-03-17 02:59:59,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-17 02:59:59,186 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 40 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:59:59,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 188 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:59:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-17 02:59:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-03-17 02:59:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 156 states have (on average 1.2115384615384615) internal successors, (189), 158 states have internal predecessors, (189), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-17 02:59:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 295 transitions. [2025-03-17 02:59:59,203 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 295 transitions. Word has length 102 [2025-03-17 02:59:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:59:59,203 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 295 transitions. [2025-03-17 02:59:59,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 02:59:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 295 transitions. [2025-03-17 02:59:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 02:59:59,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:59:59,205 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 02:59:59,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:59:59,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:59:59,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:59:59,206 INFO L85 PathProgramCache]: Analyzing trace with hash 108557115, now seen corresponding path program 1 times [2025-03-17 02:59:59,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:59:59,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905084951] [2025-03-17 02:59:59,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:59:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:59:59,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 02:59:59,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 02:59:59,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:59:59,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2025-03-17 03:00:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:00,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905084951] [2025-03-17 03:00:00,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905084951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:00,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:00,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:00:00,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219164133] [2025-03-17 03:00:00,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:00,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:00:00,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:00,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:00:00,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:00:00,477 INFO L87 Difference]: Start difference. First operand 216 states and 295 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:00,912 INFO L93 Difference]: Finished difference Result 401 states and 544 transitions. [2025-03-17 03:00:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:00:00,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 169 [2025-03-17 03:00:00,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:00,914 INFO L225 Difference]: With dead ends: 401 [2025-03-17 03:00:00,914 INFO L226 Difference]: Without dead ends: 295 [2025-03-17 03:00:00,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:00:00,915 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 78 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:00,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 257 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:00:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-17 03:00:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 216. [2025-03-17 03:00:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 156 states have (on average 1.2115384615384615) internal successors, (189), 158 states have internal predecessors, (189), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-17 03:00:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 295 transitions. [2025-03-17 03:00:00,930 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 295 transitions. Word has length 169 [2025-03-17 03:00:00,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:00,931 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 295 transitions. [2025-03-17 03:00:00,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 295 transitions. [2025-03-17 03:00:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 03:00:00,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:00,932 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:00:00,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 03:00:00,932 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:00,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1698897348, now seen corresponding path program 1 times [2025-03-17 03:00:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589250669] [2025-03-17 03:00:00,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:00,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 03:00:00,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 03:00:00,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:00,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2025-03-17 03:00:01,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589250669] [2025-03-17 03:00:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589250669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:01,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:01,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:00:01,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363270563] [2025-03-17 03:00:01,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:01,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:00:01,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:01,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:00:01,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:00:01,642 INFO L87 Difference]: Start difference. First operand 216 states and 295 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:02,300 INFO L93 Difference]: Finished difference Result 428 states and 581 transitions. [2025-03-17 03:00:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:00:02,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 169 [2025-03-17 03:00:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:02,302 INFO L225 Difference]: With dead ends: 428 [2025-03-17 03:00:02,302 INFO L226 Difference]: Without dead ends: 322 [2025-03-17 03:00:02,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:00:02,303 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 102 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:02,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 337 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:00:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-17 03:00:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 272. [2025-03-17 03:00:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 194 states have (on average 1.1855670103092784) internal successors, (230), 198 states have internal predecessors, (230), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-17 03:00:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 368 transitions. [2025-03-17 03:00:02,330 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 368 transitions. Word has length 169 [2025-03-17 03:00:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:02,331 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 368 transitions. [2025-03-17 03:00:02,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 368 transitions. [2025-03-17 03:00:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 03:00:02,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:02,332 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:00:02,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 03:00:02,332 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:02,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:02,333 INFO L85 PathProgramCache]: Analyzing trace with hash -573123382, now seen corresponding path program 1 times [2025-03-17 03:00:02,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:02,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015589922] [2025-03-17 03:00:02,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:02,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:02,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 03:00:02,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 03:00:02,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:02,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2025-03-17 03:00:04,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:04,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015589922] [2025-03-17 03:00:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015589922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:04,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:04,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:00:04,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680891201] [2025-03-17 03:00:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:04,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:00:04,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:04,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:00:04,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:00:04,564 INFO L87 Difference]: Start difference. First operand 272 states and 368 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:05,914 INFO L93 Difference]: Finished difference Result 314 states and 414 transitions. [2025-03-17 03:00:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:00:05,915 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 177 [2025-03-17 03:00:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:05,916 INFO L225 Difference]: With dead ends: 314 [2025-03-17 03:00:05,916 INFO L226 Difference]: Without dead ends: 312 [2025-03-17 03:00:05,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:00:05,917 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 126 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:05,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 776 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:00:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-17 03:00:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 279. [2025-03-17 03:00:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 201 states have (on average 1.1940298507462686) internal successors, (240), 205 states have internal predecessors, (240), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-17 03:00:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 378 transitions. [2025-03-17 03:00:05,941 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 378 transitions. Word has length 177 [2025-03-17 03:00:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:05,941 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 378 transitions. [2025-03-17 03:00:05,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 378 transitions. [2025-03-17 03:00:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-17 03:00:05,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:05,943 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 03:00:05,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 03:00:05,943 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:05,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash 115718546, now seen corresponding path program 1 times [2025-03-17 03:00:05,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:05,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615181344] [2025-03-17 03:00:05,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:05,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:05,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 03:00:05,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 03:00:05,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:05,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2025-03-17 03:00:06,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:06,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615181344] [2025-03-17 03:00:06,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615181344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:06,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:06,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:00:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194206030] [2025-03-17 03:00:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:06,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:00:06,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:06,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:00:06,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:00:06,008 INFO L87 Difference]: Start difference. First operand 279 states and 378 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:06,075 INFO L93 Difference]: Finished difference Result 572 states and 776 transitions. [2025-03-17 03:00:06,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:00:06,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 180 [2025-03-17 03:00:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:06,077 INFO L225 Difference]: With dead ends: 572 [2025-03-17 03:00:06,078 INFO L226 Difference]: Without dead ends: 403 [2025-03-17 03:00:06,079 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-17 03:00:06,080 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 56 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:06,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 190 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:00:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-17 03:00:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2025-03-17 03:00:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 283 states have (on average 1.1660777385159011) internal successors, (330), 290 states have internal predecessors, (330), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 03:00:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 540 transitions. [2025-03-17 03:00:06,119 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 540 transitions. Word has length 180 [2025-03-17 03:00:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:06,120 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 540 transitions. [2025-03-17 03:00:06,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 540 transitions. [2025-03-17 03:00:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-17 03:00:06,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:06,123 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 03:00:06,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 03:00:06,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:06,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:06,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1727340171, now seen corresponding path program 1 times [2025-03-17 03:00:06,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:06,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052930639] [2025-03-17 03:00:06,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:06,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:06,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 03:00:06,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 03:00:06,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:06,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2025-03-17 03:00:06,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:06,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052930639] [2025-03-17 03:00:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052930639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:06,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:06,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:00:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252815008] [2025-03-17 03:00:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:06,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:00:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:06,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:00:06,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:00:06,187 INFO L87 Difference]: Start difference. First operand 401 states and 540 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:06,266 INFO L93 Difference]: Finished difference Result 832 states and 1124 transitions. [2025-03-17 03:00:06,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:00:06,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 180 [2025-03-17 03:00:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:06,270 INFO L225 Difference]: With dead ends: 832 [2025-03-17 03:00:06,270 INFO L226 Difference]: Without dead ends: 541 [2025-03-17 03:00:06,273 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-17 03:00:06,274 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 61 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:06,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 132 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:00:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-17 03:00:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 395. [2025-03-17 03:00:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 277 states have (on average 1.1588447653429603) internal successors, (321), 284 states have internal predecessors, (321), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 03:00:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 531 transitions. [2025-03-17 03:00:06,314 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 531 transitions. Word has length 180 [2025-03-17 03:00:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:06,314 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 531 transitions. [2025-03-17 03:00:06,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 531 transitions. [2025-03-17 03:00:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 03:00:06,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:06,317 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 03:00:06,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 03:00:06,317 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:06,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash 351529223, now seen corresponding path program 1 times [2025-03-17 03:00:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:06,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005692853] [2025-03-17 03:00:06,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:06,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:06,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 03:00:06,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 03:00:06,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:06,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:07,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2025-03-17 03:00:07,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:07,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005692853] [2025-03-17 03:00:07,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005692853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:07,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:07,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:00:07,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45174281] [2025-03-17 03:00:07,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:07,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:00:07,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:07,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:00:07,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:00:07,054 INFO L87 Difference]: Start difference. First operand 395 states and 531 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:07,262 INFO L93 Difference]: Finished difference Result 727 states and 976 transitions. [2025-03-17 03:00:07,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:00:07,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 183 [2025-03-17 03:00:07,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:07,265 INFO L225 Difference]: With dead ends: 727 [2025-03-17 03:00:07,265 INFO L226 Difference]: Without dead ends: 442 [2025-03-17 03:00:07,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:00:07,269 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 107 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:07,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 267 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:00:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-17 03:00:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 395. [2025-03-17 03:00:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 277 states have (on average 1.144404332129964) internal successors, (317), 284 states have internal predecessors, (317), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 03:00:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 527 transitions. [2025-03-17 03:00:07,307 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 527 transitions. Word has length 183 [2025-03-17 03:00:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:07,307 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 527 transitions. [2025-03-17 03:00:07,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:07,309 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 527 transitions. [2025-03-17 03:00:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 03:00:07,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:07,310 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:00:07,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 03:00:07,311 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:07,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:07,311 INFO L85 PathProgramCache]: Analyzing trace with hash 986645259, now seen corresponding path program 1 times [2025-03-17 03:00:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:07,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753963841] [2025-03-17 03:00:07,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:07,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:07,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 03:00:07,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 03:00:07,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:07,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2025-03-17 03:00:09,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:09,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753963841] [2025-03-17 03:00:09,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753963841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:09,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:09,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 03:00:09,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630362816] [2025-03-17 03:00:09,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:09,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:00:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:09,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:00:09,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:00:09,703 INFO L87 Difference]: Start difference. First operand 395 states and 527 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:11,148 INFO L93 Difference]: Finished difference Result 443 states and 576 transitions. [2025-03-17 03:00:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 03:00:11,151 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 187 [2025-03-17 03:00:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:11,154 INFO L225 Difference]: With dead ends: 443 [2025-03-17 03:00:11,154 INFO L226 Difference]: Without dead ends: 441 [2025-03-17 03:00:11,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2025-03-17 03:00:11,155 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 106 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:11,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 857 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:00:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-17 03:00:11,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 407. [2025-03-17 03:00:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 289 states have (on average 1.1453287197231834) internal successors, (331), 296 states have internal predecessors, (331), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 03:00:11,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 541 transitions. [2025-03-17 03:00:11,204 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 541 transitions. Word has length 187 [2025-03-17 03:00:11,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:11,204 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 541 transitions. [2025-03-17 03:00:11,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 541 transitions. [2025-03-17 03:00:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 03:00:11,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:11,206 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:00:11,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 03:00:11,206 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:11,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1983717612, now seen corresponding path program 1 times [2025-03-17 03:00:11,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:11,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143128526] [2025-03-17 03:00:11,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:00:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:11,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 03:00:11,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 03:00:11,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:00:11,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2025-03-17 03:00:12,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:12,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143128526] [2025-03-17 03:00:12,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143128526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:12,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:12,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:00:12,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484868199] [2025-03-17 03:00:12,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:12,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:00:12,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:12,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:00:12,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:00:12,033 INFO L87 Difference]: Start difference. First operand 407 states and 541 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:12,357 INFO L93 Difference]: Finished difference Result 733 states and 976 transitions. [2025-03-17 03:00:12,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:00:12,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 187 [2025-03-17 03:00:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:12,361 INFO L225 Difference]: With dead ends: 733 [2025-03-17 03:00:12,361 INFO L226 Difference]: Without dead ends: 436 [2025-03-17 03:00:12,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:00:12,363 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 122 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:12,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 347 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:00:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-17 03:00:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 391. [2025-03-17 03:00:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 273 states have (on average 1.1391941391941391) internal successors, (311), 280 states have internal predecessors, (311), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 03:00:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 521 transitions. [2025-03-17 03:00:12,396 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 521 transitions. Word has length 187 [2025-03-17 03:00:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:12,397 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 521 transitions. [2025-03-17 03:00:12,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 521 transitions. [2025-03-17 03:00:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-17 03:00:12,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:12,400 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:00:12,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 03:00:12,400 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:12,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2145359451, now seen corresponding path program 2 times [2025-03-17 03:00:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:12,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809391192] [2025-03-17 03:00:12,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 03:00:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:12,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 262 statements into 2 equivalence classes. [2025-03-17 03:00:12,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 262 statements. [2025-03-17 03:00:12,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 03:00:12,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3041 trivial. 0 not checked. [2025-03-17 03:00:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:13,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809391192] [2025-03-17 03:00:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809391192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 03:00:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400418156] [2025-03-17 03:00:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:13,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:00:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:13,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:00:13,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:00:13,029 INFO L87 Difference]: Start difference. First operand 391 states and 521 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:13,506 INFO L93 Difference]: Finished difference Result 415 states and 544 transitions. [2025-03-17 03:00:13,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 03:00:13,508 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 262 [2025-03-17 03:00:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:13,510 INFO L225 Difference]: With dead ends: 415 [2025-03-17 03:00:13,511 INFO L226 Difference]: Without dead ends: 413 [2025-03-17 03:00:13,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-17 03:00:13,512 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 123 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:13,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 416 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:00:13,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-17 03:00:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 387. [2025-03-17 03:00:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 269 states have (on average 1.137546468401487) internal successors, (306), 276 states have internal predecessors, (306), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 03:00:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 516 transitions. [2025-03-17 03:00:13,547 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 516 transitions. Word has length 262 [2025-03-17 03:00:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:13,547 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 516 transitions. [2025-03-17 03:00:13,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 516 transitions. [2025-03-17 03:00:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-17 03:00:13,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:13,549 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:00:13,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 03:00:13,549 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:13,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2008231330, now seen corresponding path program 2 times [2025-03-17 03:00:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:13,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997459827] [2025-03-17 03:00:13,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 03:00:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:13,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 268 statements into 2 equivalence classes. [2025-03-17 03:00:13,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 268 statements. [2025-03-17 03:00:13,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 03:00:13,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3041 trivial. 0 not checked. [2025-03-17 03:00:13,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997459827] [2025-03-17 03:00:13,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997459827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:13,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:13,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:00:13,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839814989] [2025-03-17 03:00:13,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:13,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:00:13,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:13,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:00:13,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:00:13,610 INFO L87 Difference]: Start difference. First operand 387 states and 516 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:13,780 INFO L93 Difference]: Finished difference Result 833 states and 1116 transitions. [2025-03-17 03:00:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:00:13,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 268 [2025-03-17 03:00:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:13,783 INFO L225 Difference]: With dead ends: 833 [2025-03-17 03:00:13,783 INFO L226 Difference]: Without dead ends: 556 [2025-03-17 03:00:13,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-17 03:00:13,785 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 107 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:13,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 248 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:00:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-17 03:00:13,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 492. [2025-03-17 03:00:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 334 states have (on average 1.1137724550898203) internal successors, (372), 344 states have internal predecessors, (372), 141 states have call successors, (141), 16 states have call predecessors, (141), 16 states have return successors, (141), 131 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-17 03:00:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 654 transitions. [2025-03-17 03:00:13,860 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 654 transitions. Word has length 268 [2025-03-17 03:00:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:13,861 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 654 transitions. [2025-03-17 03:00:13,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 654 transitions. [2025-03-17 03:00:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 03:00:13,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:13,863 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:00:13,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 03:00:13,864 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:13,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:13,864 INFO L85 PathProgramCache]: Analyzing trace with hash -321617370, now seen corresponding path program 2 times [2025-03-17 03:00:13,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:13,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799443506] [2025-03-17 03:00:13,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 03:00:13,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:13,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 272 statements into 2 equivalence classes. [2025-03-17 03:00:13,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 272 statements. [2025-03-17 03:00:13,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 03:00:13,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3041 trivial. 0 not checked. [2025-03-17 03:00:15,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:15,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799443506] [2025-03-17 03:00:15,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799443506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:15,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:00:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374546470] [2025-03-17 03:00:15,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:15,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:00:15,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:15,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:00:15,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:00:15,272 INFO L87 Difference]: Start difference. First operand 492 states and 654 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:16,312 INFO L93 Difference]: Finished difference Result 559 states and 723 transitions. [2025-03-17 03:00:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 03:00:16,312 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 272 [2025-03-17 03:00:16,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:16,315 INFO L225 Difference]: With dead ends: 559 [2025-03-17 03:00:16,315 INFO L226 Difference]: Without dead ends: 557 [2025-03-17 03:00:16,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2025-03-17 03:00:16,316 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 92 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:16,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 601 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:00:16,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-17 03:00:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 504. [2025-03-17 03:00:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 346 states have (on average 1.115606936416185) internal successors, (386), 356 states have internal predecessors, (386), 141 states have call successors, (141), 16 states have call predecessors, (141), 16 states have return successors, (141), 131 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-17 03:00:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 668 transitions. [2025-03-17 03:00:16,369 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 668 transitions. Word has length 272 [2025-03-17 03:00:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:16,370 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 668 transitions. [2025-03-17 03:00:16,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 668 transitions. [2025-03-17 03:00:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 03:00:16,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:00:16,372 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:00:16,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 03:00:16,372 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:00:16,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:00:16,373 INFO L85 PathProgramCache]: Analyzing trace with hash 675454983, now seen corresponding path program 2 times [2025-03-17 03:00:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:00:16,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73636432] [2025-03-17 03:00:16,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 03:00:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:00:16,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 272 statements into 2 equivalence classes. [2025-03-17 03:00:16,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 272 statements. [2025-03-17 03:00:16,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 03:00:16,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:00:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3041 trivial. 0 not checked. [2025-03-17 03:00:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:00:16,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73636432] [2025-03-17 03:00:16,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73636432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:00:16,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:00:16,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:00:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003670845] [2025-03-17 03:00:16,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:00:16,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:00:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:00:16,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:00:16,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:00:16,456 INFO L87 Difference]: Start difference. First operand 504 states and 668 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:00:16,629 INFO L93 Difference]: Finished difference Result 949 states and 1264 transitions. [2025-03-17 03:00:16,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:00:16,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 272 [2025-03-17 03:00:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:00:16,632 INFO L225 Difference]: With dead ends: 949 [2025-03-17 03:00:16,632 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 03:00:16,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:00:16,638 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 115 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:00:16,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 312 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:00:16,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 03:00:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 03:00:16,640 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-17 03:00:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 03:00:16,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 272 [2025-03-17 03:00:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:00:16,641 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 03:00:16,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:00:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 03:00:16,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 03:00:16,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:00:16,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 03:00:16,645 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:00:16,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 03:00:28,193 WARN L286 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 333 DAG size of output: 264 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-17 03:00:32,921 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:00:32,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:00:32 BoogieIcfgContainer [2025-03-17 03:00:32,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:00:32,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:00:32,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:00:32,930 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:00:32,932 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:50" (3/4) ... [2025-03-17 03:00:32,933 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 03:00:32,937 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 03:00:32,942 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 03:00:32,942 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 03:00:32,942 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 03:00:32,943 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 03:00:33,006 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 03:00:33,006 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 03:00:33,006 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:00:33,007 INFO L158 Benchmark]: Toolchain (without parser) took 43740.95ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 106.9MB in the beginning and 843.3MB in the end (delta: -736.3MB). Peak memory consumption was 378.3MB. Max. memory is 16.1GB. [2025-03-17 03:00:33,008 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:00:33,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.05ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 93.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:00:33,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.08ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:00:33,008 INFO L158 Benchmark]: Boogie Preprocessor took 49.58ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 88.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:00:33,009 INFO L158 Benchmark]: IcfgBuilder took 430.33ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 67.7MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 03:00:33,009 INFO L158 Benchmark]: TraceAbstraction took 42913.73ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 67.7MB in the beginning and 847.9MB in the end (delta: -780.2MB). Peak memory consumption was 708.4MB. Max. memory is 16.1GB. [2025-03-17 03:00:33,009 INFO L158 Benchmark]: Witness Printer took 76.48ms. Allocated memory is still 1.3GB. Free memory was 847.9MB in the beginning and 843.3MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:00:33,010 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.05ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 93.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.08ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.58ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 88.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 430.33ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 67.7MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42913.73ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 67.7MB in the beginning and 847.9MB in the end (delta: -780.2MB). Peak memory consumption was 708.4MB. Max. memory is 16.1GB. * Witness Printer took 76.48ms. Allocated memory is still 1.3GB. Free memory was 847.9MB in the beginning and 843.3MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 2 procedures, 58 locations, 101 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.6s, OverallIterations: 22, TraceHistogramMax: 39, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1841 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1841 mSDsluCounter, 7746 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5487 mSDsCounter, 169 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5210 IncrementalHoareTripleChecker+Invalid, 5379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 169 mSolverCounterUnsat, 2259 mSDtfsCounter, 5210 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 611 GetRequests, 400 SyntacticMatches, 6 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=504occurred in iteration=21, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 746 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 3664 NumberOfCodeBlocks, 2724 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3727 ConstructedInterpolants, 0 QuantifiedInterpolants, 21182 SizeOfPredicates, 12 NumberOfNonLiveVariables, 635 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 27138/27264 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: 97]: Location Invariant Derived location invariant: ((((((((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && (((var_1_14 / var_1_3) + 1) <= var_1_14)) && ((9 + var_1_14) <= var_1_15)) && ((var_1_7 == 0) || (var_1_5 == 0))) && (16 <= var_1_14)) && (var_1_15 <= 25)) && (var_1_1 == 0)) && (0 <= 0)) && ((var_1_8 + 1) == 0)) || (((((var_1_14 == ((var_1_8 >= 0) ? (var_1_8 % 65536) : ((var_1_8 % 65536) + 65536))) && (var_1_13 == var_1_10)) && (var_1_15 == var_1_3)) && ((0 < 1) || (var_1_8 == var_1_14))) && (var_1_14 <= var_1_8))) RESULT: Ultimate proved your program to be correct! [2025-03-17 03:00:33,124 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