./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem18_label17.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 926b7b9d6547e72bfa5d12c411fdf31134212d85b2e49cebf30ae587ba070010 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:23:21,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:23:21,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:23:21,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:23:21,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:23:21,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:23:21,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:23:21,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:23:21,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:23:21,456 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:23:21,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:23:21,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:23:21,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:23:21,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:23:21,457 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:23:21,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:23:21,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:23:21,457 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:23:21,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:23:21,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:23:21,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:23:21,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:23:21,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:23:21,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:23:21,458 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:23:21,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:23:21,458 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:23:21,458 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:23:21,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:23:21,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:23:21,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:23:21,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:23:21,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:23:21,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:23:21,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:23:21,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:23:21,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:23:21,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:23:21,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:23:21,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:23:21,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:23:21,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:23:21,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:23:21,460 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 -> 926b7b9d6547e72bfa5d12c411fdf31134212d85b2e49cebf30ae587ba070010 [2025-03-16 15:23:21,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:23:21,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:23:21,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:23:21,676 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:23:21,676 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:23:21,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label17.c [2025-03-16 15:23:22,750 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855b8dbe5/7dc775c493d64c22b008986fdb33c71b/FLAG81eb11e4a [2025-03-16 15:23:23,144 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:23:23,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label17.c [2025-03-16 15:23:23,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855b8dbe5/7dc775c493d64c22b008986fdb33c71b/FLAG81eb11e4a [2025-03-16 15:23:23,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855b8dbe5/7dc775c493d64c22b008986fdb33c71b [2025-03-16 15:23:23,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:23:23,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:23:23,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:23:23,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:23:23,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:23:23,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:23,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20278eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23, skipping insertion in model container [2025-03-16 15:23:23,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:23,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:23:23,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label17.c[3487,3500] [2025-03-16 15:23:23,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:23:23,764 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:23:23,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label17.c[3487,3500] [2025-03-16 15:23:23,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:23:23,983 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:23:23,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23 WrapperNode [2025-03-16 15:23:23,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:23:23,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:23:23,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:23:23,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:23:23,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,135 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-16 15:23:24,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:23:24,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:23:24,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:23:24,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:23:24,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,270 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:23:24,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:23:24,363 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:23:24,363 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:23:24,364 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:23:24,364 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (1/1) ... [2025-03-16 15:23:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:23:24,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:24,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:23:24,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:23:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:23:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:23:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:23:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:23:24,453 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:23:24,454 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:23:27,013 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-16 15:23:27,014 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-16 15:23:27,103 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-16 15:23:27,103 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:23:27,124 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:23:27,124 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:23:27,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:23:27 BoogieIcfgContainer [2025-03-16 15:23:27,125 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:23:27,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:23:27,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:23:27,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:23:27,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:23:23" (1/3) ... [2025-03-16 15:23:27,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b575078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:23:27, skipping insertion in model container [2025-03-16 15:23:27,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:23" (2/3) ... [2025-03-16 15:23:27,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b575078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:23:27, skipping insertion in model container [2025-03-16 15:23:27,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:23:27" (3/3) ... [2025-03-16 15:23:27,131 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label17.c [2025-03-16 15:23:27,142 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:23:27,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label17.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:23:27,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:23:27,202 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;@c09f86e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:23:27,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:23:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:27,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 15:23:27,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:27,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:27,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:27,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash 214840573, now seen corresponding path program 1 times [2025-03-16 15:23:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:27,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657375260] [2025-03-16 15:23:27,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:27,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:27,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 15:23:27,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 15:23:27,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:27,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:27,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:27,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657375260] [2025-03-16 15:23:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657375260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:27,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:27,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437365344] [2025-03-16 15:23:27,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:27,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:23:27,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:27,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:23:27,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:23:27,349 INFO L87 Difference]: Start difference. First operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:27,404 INFO L93 Difference]: Finished difference Result 1391 states and 2763 transitions. [2025-03-16 15:23:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:23:27,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-16 15:23:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:27,423 INFO L225 Difference]: With dead ends: 1391 [2025-03-16 15:23:27,425 INFO L226 Difference]: Without dead ends: 693 [2025-03-16 15:23:27,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:23:27,433 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:27,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:23:27,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-16 15:23:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2025-03-16 15:23:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2025-03-16 15:23:27,499 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 30 [2025-03-16 15:23:27,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:27,500 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2025-03-16 15:23:27,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2025-03-16 15:23:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 15:23:27,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:27,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:27,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:23:27,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:27,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash -714638751, now seen corresponding path program 1 times [2025-03-16 15:23:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:27,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141546770] [2025-03-16 15:23:27,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:27,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:27,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 15:23:27,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 15:23:27,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:27,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:27,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141546770] [2025-03-16 15:23:27,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141546770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:27,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:27,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:27,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810227362] [2025-03-16 15:23:27,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:27,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:27,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:27,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:27,688 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:31,724 INFO L93 Difference]: Finished difference Result 2765 states and 5263 transitions. [2025-03-16 15:23:31,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:31,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-16 15:23:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:31,731 INFO L225 Difference]: With dead ends: 2765 [2025-03-16 15:23:31,731 INFO L226 Difference]: Without dead ends: 2073 [2025-03-16 15:23:31,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:23:31,733 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 2030 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5101 mSolverCounterSat, 951 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2030 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 6052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 951 IncrementalHoareTripleChecker+Valid, 5101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:31,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2030 Valid, 641 Invalid, 6052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [951 Valid, 5101 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-16 15:23:31,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2025-03-16 15:23:31,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 2073. [2025-03-16 15:23:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2072 states have (on average 1.5535714285714286) internal successors, (3219), 2072 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3219 transitions. [2025-03-16 15:23:31,787 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3219 transitions. Word has length 30 [2025-03-16 15:23:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:31,788 INFO L471 AbstractCegarLoop]: Abstraction has 2073 states and 3219 transitions. [2025-03-16 15:23:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3219 transitions. [2025-03-16 15:23:31,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 15:23:31,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:31,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:31,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:23:31,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:31,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:31,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2028197526, now seen corresponding path program 1 times [2025-03-16 15:23:31,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:31,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744678801] [2025-03-16 15:23:31,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:31,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 15:23:31,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 15:23:31,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:31,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:31,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744678801] [2025-03-16 15:23:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744678801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:31,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415551994] [2025-03-16 15:23:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:31,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:31,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:31,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:31,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:31,975 INFO L87 Difference]: Start difference. First operand 2073 states and 3219 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:34,174 INFO L93 Difference]: Finished difference Result 5525 states and 8952 transitions. [2025-03-16 15:23:34,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:34,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-03-16 15:23:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:34,186 INFO L225 Difference]: With dead ends: 5525 [2025-03-16 15:23:34,187 INFO L226 Difference]: Without dead ends: 3453 [2025-03-16 15:23:34,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:34,190 INFO L435 NwaCegarLoop]: 1068 mSDtfsCounter, 685 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 880 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 880 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:34,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1074 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [880 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:23:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2025-03-16 15:23:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 3453. [2025-03-16 15:23:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3453 states, 3452 states have (on average 1.4695828505214368) internal successors, (5073), 3452 states have internal predecessors, (5073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3453 states to 3453 states and 5073 transitions. [2025-03-16 15:23:34,262 INFO L78 Accepts]: Start accepts. Automaton has 3453 states and 5073 transitions. Word has length 123 [2025-03-16 15:23:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:34,262 INFO L471 AbstractCegarLoop]: Abstraction has 3453 states and 5073 transitions. [2025-03-16 15:23:34,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3453 states and 5073 transitions. [2025-03-16 15:23:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 15:23:34,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:34,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:34,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:23:34,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:34,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash 508467151, now seen corresponding path program 1 times [2025-03-16 15:23:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739672907] [2025-03-16 15:23:34,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:34,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 15:23:34,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 15:23:34,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:34,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:34,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:34,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739672907] [2025-03-16 15:23:34,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739672907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:34,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:34,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:34,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904900810] [2025-03-16 15:23:34,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:34,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:34,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:34,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:34,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:34,670 INFO L87 Difference]: Start difference. First operand 3453 states and 5073 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:37,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:37,569 INFO L93 Difference]: Finished difference Result 9665 states and 14562 transitions. [2025-03-16 15:23:37,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:37,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-16 15:23:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:37,583 INFO L225 Difference]: With dead ends: 9665 [2025-03-16 15:23:37,583 INFO L226 Difference]: Without dead ends: 6213 [2025-03-16 15:23:37,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:23:37,593 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 1872 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4378 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 5000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 4378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:37,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 646 Invalid, 5000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 4378 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 15:23:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6213 states. [2025-03-16 15:23:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6213 to 5523. [2025-03-16 15:23:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5523 states, 5522 states have (on average 1.3391886997464686) internal successors, (7395), 5522 states have internal predecessors, (7395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 7395 transitions. [2025-03-16 15:23:37,672 INFO L78 Accepts]: Start accepts. Automaton has 5523 states and 7395 transitions. Word has length 148 [2025-03-16 15:23:37,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:37,673 INFO L471 AbstractCegarLoop]: Abstraction has 5523 states and 7395 transitions. [2025-03-16 15:23:37,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 5523 states and 7395 transitions. [2025-03-16 15:23:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-16 15:23:37,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:37,680 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:37,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:23:37,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:37,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash -733651133, now seen corresponding path program 1 times [2025-03-16 15:23:37,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:37,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958732478] [2025-03-16 15:23:37,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:37,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-16 15:23:37,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-16 15:23:37,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:37,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:38,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:38,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958732478] [2025-03-16 15:23:38,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958732478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:38,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:38,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:38,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18313175] [2025-03-16 15:23:38,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:38,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:38,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:38,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:38,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:38,039 INFO L87 Difference]: Start difference. First operand 5523 states and 7395 transitions. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:40,115 INFO L93 Difference]: Finished difference Result 13858 states and 18478 transitions. [2025-03-16 15:23:40,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:40,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 303 [2025-03-16 15:23:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:40,132 INFO L225 Difference]: With dead ends: 13858 [2025-03-16 15:23:40,132 INFO L226 Difference]: Without dead ends: 8283 [2025-03-16 15:23:40,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:40,137 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 513 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 3749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:40,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 635 Invalid, 3749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:23:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2025-03-16 15:23:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 7593. [2025-03-16 15:23:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7593 states, 7592 states have (on average 1.184799789251844) internal successors, (8995), 7592 states have internal predecessors, (8995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 8995 transitions. [2025-03-16 15:23:40,225 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 8995 transitions. Word has length 303 [2025-03-16 15:23:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:40,225 INFO L471 AbstractCegarLoop]: Abstraction has 7593 states and 8995 transitions. [2025-03-16 15:23:40,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 8995 transitions. [2025-03-16 15:23:40,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 914 [2025-03-16 15:23:40,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:40,238 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:40,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:23:40,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:40,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 614046866, now seen corresponding path program 1 times [2025-03-16 15:23:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:40,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959877241] [2025-03-16 15:23:40,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:40,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 913 statements into 1 equivalence classes. [2025-03-16 15:23:40,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 913 of 913 statements. [2025-03-16 15:23:40,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:40,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-16 15:23:40,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:40,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959877241] [2025-03-16 15:23:40,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959877241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:40,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:40,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:40,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125493617] [2025-03-16 15:23:40,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:40,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:40,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:40,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:40,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:40,892 INFO L87 Difference]: Start difference. First operand 7593 states and 8995 transitions. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:42,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:42,443 INFO L93 Difference]: Finished difference Result 18635 states and 22711 transitions. [2025-03-16 15:23:42,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:42,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 913 [2025-03-16 15:23:42,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:42,464 INFO L225 Difference]: With dead ends: 18635 [2025-03-16 15:23:42,464 INFO L226 Difference]: Without dead ends: 11043 [2025-03-16 15:23:42,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:42,472 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 226 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:42,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 388 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:23:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11043 states. [2025-03-16 15:23:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11043 to 9663. [2025-03-16 15:23:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9663 states, 9662 states have (on average 1.1632167253156696) internal successors, (11239), 9662 states have internal predecessors, (11239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9663 states to 9663 states and 11239 transitions. [2025-03-16 15:23:42,597 INFO L78 Accepts]: Start accepts. Automaton has 9663 states and 11239 transitions. Word has length 913 [2025-03-16 15:23:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:42,597 INFO L471 AbstractCegarLoop]: Abstraction has 9663 states and 11239 transitions. [2025-03-16 15:23:42,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 9663 states and 11239 transitions. [2025-03-16 15:23:42,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 963 [2025-03-16 15:23:42,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:42,618 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:42,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:23:42,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:42,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:42,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1217497751, now seen corresponding path program 1 times [2025-03-16 15:23:42,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:42,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970709547] [2025-03-16 15:23:42,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:42,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:42,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 962 statements into 1 equivalence classes. [2025-03-16 15:23:42,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 962 of 962 statements. [2025-03-16 15:23:42,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:42,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-16 15:23:43,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:43,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970709547] [2025-03-16 15:23:43,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970709547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:43,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:43,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:43,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713073376] [2025-03-16 15:23:43,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:43,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:43,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:43,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:43,593 INFO L87 Difference]: Start difference. First operand 9663 states and 11239 transitions. Second operand has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:45,204 INFO L93 Difference]: Finished difference Result 24155 states and 28391 transitions. [2025-03-16 15:23:45,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:45,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 962 [2025-03-16 15:23:45,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:45,227 INFO L225 Difference]: With dead ends: 24155 [2025-03-16 15:23:45,227 INFO L226 Difference]: Without dead ends: 14493 [2025-03-16 15:23:45,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:45,236 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 574 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:45,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1090 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:23:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14493 states. [2025-03-16 15:23:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14493 to 13803. [2025-03-16 15:23:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13803 states, 13802 states have (on average 1.1449065352847414) internal successors, (15802), 13802 states have internal predecessors, (15802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13803 states to 13803 states and 15802 transitions. [2025-03-16 15:23:45,407 INFO L78 Accepts]: Start accepts. Automaton has 13803 states and 15802 transitions. Word has length 962 [2025-03-16 15:23:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:45,409 INFO L471 AbstractCegarLoop]: Abstraction has 13803 states and 15802 transitions. [2025-03-16 15:23:45,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 13803 states and 15802 transitions. [2025-03-16 15:23:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 973 [2025-03-16 15:23:45,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:45,416 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:45,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:23:45,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:45,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash 63926769, now seen corresponding path program 1 times [2025-03-16 15:23:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907157694] [2025-03-16 15:23:45,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:45,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 972 statements into 1 equivalence classes. [2025-03-16 15:23:45,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 972 of 972 statements. [2025-03-16 15:23:45,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:45,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-16 15:23:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:45,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907157694] [2025-03-16 15:23:45,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907157694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:45,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:45,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:45,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828079713] [2025-03-16 15:23:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:45,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:45,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:45,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:45,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:45,863 INFO L87 Difference]: Start difference. First operand 13803 states and 15802 transitions. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:47,306 INFO L93 Difference]: Finished difference Result 32435 states and 37242 transitions. [2025-03-16 15:23:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:47,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 972 [2025-03-16 15:23:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:47,338 INFO L225 Difference]: With dead ends: 32435 [2025-03-16 15:23:47,338 INFO L226 Difference]: Without dead ends: 18633 [2025-03-16 15:23:47,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:47,351 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:47,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 76 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:23:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18633 states. [2025-03-16 15:23:47,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18633 to 18633. [2025-03-16 15:23:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18633 states, 18632 states have (on average 1.132567625590382) internal successors, (21102), 18632 states have internal predecessors, (21102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 21102 transitions. [2025-03-16 15:23:47,597 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 21102 transitions. Word has length 972 [2025-03-16 15:23:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:47,599 INFO L471 AbstractCegarLoop]: Abstraction has 18633 states and 21102 transitions. [2025-03-16 15:23:47,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 21102 transitions. [2025-03-16 15:23:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2025-03-16 15:23:47,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:47,614 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:47,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:23:47,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:47,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:47,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2121350896, now seen corresponding path program 1 times [2025-03-16 15:23:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:47,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423706308] [2025-03-16 15:23:47,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:47,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:47,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1039 statements into 1 equivalence classes. [2025-03-16 15:23:47,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1039 of 1039 statements. [2025-03-16 15:23:47,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:47,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-16 15:23:48,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:48,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423706308] [2025-03-16 15:23:48,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423706308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:48,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:48,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 15:23:48,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246230959] [2025-03-16 15:23:48,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:48,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:23:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:48,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:23:48,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:23:48,599 INFO L87 Difference]: Start difference. First operand 18633 states and 21102 transitions. Second operand has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:50,408 INFO L93 Difference]: Finished difference Result 40070 states and 45053 transitions. [2025-03-16 15:23:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:50,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1039 [2025-03-16 15:23:50,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:50,435 INFO L225 Difference]: With dead ends: 40070 [2025-03-16 15:23:50,435 INFO L226 Difference]: Without dead ends: 18678 [2025-03-16 15:23:50,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:23:50,451 INFO L435 NwaCegarLoop]: 1066 mSDtfsCounter, 2094 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2094 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 3493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:50,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2094 Valid, 1073 Invalid, 3493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:23:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18678 states. [2025-03-16 15:23:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18678 to 17943. [2025-03-16 15:23:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17943 states, 17942 states have (on average 1.0635938022517) internal successors, (19083), 17942 states have internal predecessors, (19083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17943 states to 17943 states and 19083 transitions. [2025-03-16 15:23:50,591 INFO L78 Accepts]: Start accepts. Automaton has 17943 states and 19083 transitions. Word has length 1039 [2025-03-16 15:23:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:50,593 INFO L471 AbstractCegarLoop]: Abstraction has 17943 states and 19083 transitions. [2025-03-16 15:23:50,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 17943 states and 19083 transitions. [2025-03-16 15:23:50,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1052 [2025-03-16 15:23:50,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:50,602 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:50,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:23:50,602 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:50,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:50,603 INFO L85 PathProgramCache]: Analyzing trace with hash 889300662, now seen corresponding path program 1 times [2025-03-16 15:23:50,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:50,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881064701] [2025-03-16 15:23:50,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:50,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1051 statements into 1 equivalence classes. [2025-03-16 15:23:50,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1051 of 1051 statements. [2025-03-16 15:23:50,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:50,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-16 15:23:51,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:51,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881064701] [2025-03-16 15:23:51,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881064701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:51,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:51,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:51,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055272972] [2025-03-16 15:23:51,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:51,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:51,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:51,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:51,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:51,074 INFO L87 Difference]: Start difference. First operand 17943 states and 19083 transitions. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:52,375 INFO L93 Difference]: Finished difference Result 40715 states and 43599 transitions. [2025-03-16 15:23:52,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:52,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1051 [2025-03-16 15:23:52,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:52,404 INFO L225 Difference]: With dead ends: 40715 [2025-03-16 15:23:52,405 INFO L226 Difference]: Without dead ends: 22083 [2025-03-16 15:23:52,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:52,417 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 570 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:52,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 992 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1812 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:23:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22083 states. [2025-03-16 15:23:52,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22083 to 22083. [2025-03-16 15:23:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22083 states, 22082 states have (on average 1.0637623403677203) internal successors, (23490), 22082 states have internal predecessors, (23490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22083 states to 22083 states and 23490 transitions. [2025-03-16 15:23:52,591 INFO L78 Accepts]: Start accepts. Automaton has 22083 states and 23490 transitions. Word has length 1051 [2025-03-16 15:23:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:52,592 INFO L471 AbstractCegarLoop]: Abstraction has 22083 states and 23490 transitions. [2025-03-16 15:23:52,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 22083 states and 23490 transitions. [2025-03-16 15:23:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2025-03-16 15:23:52,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:52,600 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:52,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:23:52,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:52,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1188013519, now seen corresponding path program 1 times [2025-03-16 15:23:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:52,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404030754] [2025-03-16 15:23:52,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:52,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1079 statements into 1 equivalence classes. [2025-03-16 15:23:52,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1079 of 1079 statements. [2025-03-16 15:23:52,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:52,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-16 15:23:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:53,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404030754] [2025-03-16 15:23:53,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404030754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:53,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:53,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:53,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623457915] [2025-03-16 15:23:53,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:53,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:53,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:53,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:53,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:53,442 INFO L87 Difference]: Start difference. First operand 22083 states and 23490 transitions. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:54,756 INFO L93 Difference]: Finished difference Result 48305 states and 51483 transitions. [2025-03-16 15:23:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:54,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1079 [2025-03-16 15:23:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:54,786 INFO L225 Difference]: With dead ends: 48305 [2025-03-16 15:23:54,787 INFO L226 Difference]: Without dead ends: 25533 [2025-03-16 15:23:54,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:54,801 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 586 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:54,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 231 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:23:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25533 states. [2025-03-16 15:23:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25533 to 25533. [2025-03-16 15:23:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25533 states, 25532 states have (on average 1.060590631364562) internal successors, (27079), 25532 states have internal predecessors, (27079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25533 states to 25533 states and 27079 transitions. [2025-03-16 15:23:54,988 INFO L78 Accepts]: Start accepts. Automaton has 25533 states and 27079 transitions. Word has length 1079 [2025-03-16 15:23:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:54,988 INFO L471 AbstractCegarLoop]: Abstraction has 25533 states and 27079 transitions. [2025-03-16 15:23:54,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 25533 states and 27079 transitions. [2025-03-16 15:23:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1126 [2025-03-16 15:23:54,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:54,998 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:54,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:23:54,998 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:54,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:54,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1369637728, now seen corresponding path program 1 times [2025-03-16 15:23:54,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:54,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069692046] [2025-03-16 15:23:54,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:54,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:55,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1125 statements into 1 equivalence classes. [2025-03-16 15:23:55,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1125 of 1125 statements. [2025-03-16 15:23:55,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:55,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 323 proven. 855 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-16 15:23:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:56,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069692046] [2025-03-16 15:23:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069692046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:23:56,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085853180] [2025-03-16 15:23:56,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:56,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:23:56,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:56,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:23:56,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:23:56,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1125 statements into 1 equivalence classes. [2025-03-16 15:23:56,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1125 of 1125 statements. [2025-03-16 15:23:56,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:56,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:56,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:23:56,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:23:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-03-16 15:23:56,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:23:56,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085853180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:56,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:23:56,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-16 15:23:56,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616475395] [2025-03-16 15:23:56,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:56,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:56,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:56,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:23:56,643 INFO L87 Difference]: Start difference. First operand 25533 states and 27079 transitions. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:57,897 INFO L93 Difference]: Finished difference Result 60035 states and 63905 transitions. [2025-03-16 15:23:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:57,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1125 [2025-03-16 15:23:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:57,932 INFO L225 Difference]: With dead ends: 60035 [2025-03-16 15:23:57,932 INFO L226 Difference]: Without dead ends: 34503 [2025-03-16 15:23:57,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1133 GetRequests, 1125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:23:57,950 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 656 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:57,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 128 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:23:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34503 states. [2025-03-16 15:23:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34503 to 34503. [2025-03-16 15:23:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34503 states, 34502 states have (on average 1.0519680018549649) internal successors, (36295), 34502 states have internal predecessors, (36295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34503 states to 34503 states and 36295 transitions. [2025-03-16 15:23:58,225 INFO L78 Accepts]: Start accepts. Automaton has 34503 states and 36295 transitions. Word has length 1125 [2025-03-16 15:23:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:58,226 INFO L471 AbstractCegarLoop]: Abstraction has 34503 states and 36295 transitions. [2025-03-16 15:23:58,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 34503 states and 36295 transitions. [2025-03-16 15:23:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1211 [2025-03-16 15:23:58,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:58,237 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:58,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:23:58,442 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,SelfDestructingSolverStorable11 [2025-03-16 15:23:58,442 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:58,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash 324309624, now seen corresponding path program 1 times [2025-03-16 15:23:58,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:58,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234517484] [2025-03-16 15:23:58,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:58,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:58,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1210 statements into 1 equivalence classes. [2025-03-16 15:23:58,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1210 of 1210 statements. [2025-03-16 15:23:58,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:58,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1685 backedges. 576 proven. 833 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-16 15:23:59,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:59,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234517484] [2025-03-16 15:23:59,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234517484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:23:59,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192940586] [2025-03-16 15:23:59,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:59,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:23:59,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:59,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:23:59,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:23:59,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1210 statements into 1 equivalence classes. [2025-03-16 15:24:00,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1210 of 1210 statements. [2025-03-16 15:24:00,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:00,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:00,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:24:00,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:24:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1685 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2025-03-16 15:24:00,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:24:00,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192940586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:00,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:24:00,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-16 15:24:00,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114295623] [2025-03-16 15:24:00,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:00,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:00,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:24:00,153 INFO L87 Difference]: Start difference. First operand 34503 states and 36295 transitions. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:01,535 INFO L93 Difference]: Finished difference Result 88325 states and 93161 transitions. [2025-03-16 15:24:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:01,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1210 [2025-03-16 15:24:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:01,589 INFO L225 Difference]: With dead ends: 88325 [2025-03-16 15:24:01,590 INFO L226 Difference]: Without dead ends: 53133 [2025-03-16 15:24:01,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1217 GetRequests, 1210 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:24:01,616 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 656 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:01,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 105 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:24:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53133 states. [2025-03-16 15:24:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53133 to 51063. [2025-03-16 15:24:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51063 states, 51062 states have (on average 1.0538756805452196) internal successors, (53813), 51062 states have internal predecessors, (53813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51063 states to 51063 states and 53813 transitions. [2025-03-16 15:24:02,147 INFO L78 Accepts]: Start accepts. Automaton has 51063 states and 53813 transitions. Word has length 1210 [2025-03-16 15:24:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:02,148 INFO L471 AbstractCegarLoop]: Abstraction has 51063 states and 53813 transitions. [2025-03-16 15:24:02,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 51063 states and 53813 transitions. [2025-03-16 15:24:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1352 [2025-03-16 15:24:02,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:02,166 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:24:02,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:24:02,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 15:24:02,367 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:02,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1517922286, now seen corresponding path program 1 times [2025-03-16 15:24:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:02,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463066468] [2025-03-16 15:24:02,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:02,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1351 statements into 1 equivalence classes. [2025-03-16 15:24:02,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1351 of 1351 statements. [2025-03-16 15:24:02,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:02,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 1369 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2025-03-16 15:24:02,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463066468] [2025-03-16 15:24:02,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463066468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:02,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927902068] [2025-03-16 15:24:02,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:02,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:02,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:02,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:02,859 INFO L87 Difference]: Start difference. First operand 51063 states and 53813 transitions. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:04,227 INFO L93 Difference]: Finished difference Result 101435 states and 106931 transitions. [2025-03-16 15:24:04,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:04,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1351 [2025-03-16 15:24:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:04,271 INFO L225 Difference]: With dead ends: 101435 [2025-03-16 15:24:04,271 INFO L226 Difference]: Without dead ends: 50373 [2025-03-16 15:24:04,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:04,285 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 587 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:04,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 951 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:24:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50373 states. [2025-03-16 15:24:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50373 to 50373. [2025-03-16 15:24:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50373 states, 50372 states have (on average 1.0482212340188994) internal successors, (52801), 50372 states have internal predecessors, (52801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50373 states to 50373 states and 52801 transitions. [2025-03-16 15:24:04,634 INFO L78 Accepts]: Start accepts. Automaton has 50373 states and 52801 transitions. Word has length 1351 [2025-03-16 15:24:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:04,635 INFO L471 AbstractCegarLoop]: Abstraction has 50373 states and 52801 transitions. [2025-03-16 15:24:04,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 50373 states and 52801 transitions. [2025-03-16 15:24:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1378 [2025-03-16 15:24:04,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:04,653 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:24:04,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:24:04,653 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:04,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:04,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1719857677, now seen corresponding path program 1 times [2025-03-16 15:24:04,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:04,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146443500] [2025-03-16 15:24:04,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:04,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:04,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1377 statements into 1 equivalence classes. [2025-03-16 15:24:04,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1377 of 1377 statements. [2025-03-16 15:24:04,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:04,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 1342 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-03-16 15:24:05,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:05,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146443500] [2025-03-16 15:24:05,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146443500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:05,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:05,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969861614] [2025-03-16 15:24:05,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:05,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:05,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:05,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:05,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:05,337 INFO L87 Difference]: Start difference. First operand 50373 states and 52801 transitions. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:06,677 INFO L93 Difference]: Finished difference Result 120065 states and 126333 transitions. [2025-03-16 15:24:06,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:06,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1377 [2025-03-16 15:24:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:06,738 INFO L225 Difference]: With dead ends: 120065 [2025-03-16 15:24:06,738 INFO L226 Difference]: Without dead ends: 64173 [2025-03-16 15:24:06,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:06,772 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 572 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:06,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 942 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:24:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64173 states. [2025-03-16 15:24:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64173 to 63483. [2025-03-16 15:24:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63483 states, 63482 states have (on average 1.0431775936485932) internal successors, (66223), 63482 states have internal predecessors, (66223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63483 states to 63483 states and 66223 transitions. [2025-03-16 15:24:07,323 INFO L78 Accepts]: Start accepts. Automaton has 63483 states and 66223 transitions. Word has length 1377 [2025-03-16 15:24:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:07,323 INFO L471 AbstractCegarLoop]: Abstraction has 63483 states and 66223 transitions. [2025-03-16 15:24:07,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 63483 states and 66223 transitions. [2025-03-16 15:24:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1404 [2025-03-16 15:24:07,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:07,346 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:24:07,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:24:07,346 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1289080251, now seen corresponding path program 1 times [2025-03-16 15:24:07,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:07,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176704651] [2025-03-16 15:24:07,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:07,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1403 statements into 1 equivalence classes. [2025-03-16 15:24:07,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1403 of 1403 statements. [2025-03-16 15:24:07,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:07,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 1424 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-16 15:24:08,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:08,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176704651] [2025-03-16 15:24:08,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176704651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:08,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:08,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:08,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944592898] [2025-03-16 15:24:08,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:08,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:24:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:08,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:24:08,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:24:08,359 INFO L87 Difference]: Start difference. First operand 63483 states and 66223 transitions. Second operand has 4 states, 4 states have (on average 221.25) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:10,138 INFO L93 Difference]: Finished difference Result 126965 states and 132456 transitions. [2025-03-16 15:24:10,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:24:10,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 221.25) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1403 [2025-03-16 15:24:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:10,203 INFO L225 Difference]: With dead ends: 126965 [2025-03-16 15:24:10,204 INFO L226 Difference]: Without dead ends: 64173 [2025-03-16 15:24:10,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:24:10,240 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 986 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:10,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 66 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:24:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64173 states. [2025-03-16 15:24:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64173 to 63483. [2025-03-16 15:24:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63483 states, 63482 states have (on average 1.042957058693803) internal successors, (66209), 63482 states have internal predecessors, (66209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63483 states to 63483 states and 66209 transitions. [2025-03-16 15:24:10,777 INFO L78 Accepts]: Start accepts. Automaton has 63483 states and 66209 transitions. Word has length 1403 [2025-03-16 15:24:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:10,778 INFO L471 AbstractCegarLoop]: Abstraction has 63483 states and 66209 transitions. [2025-03-16 15:24:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 221.25) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 63483 states and 66209 transitions. [2025-03-16 15:24:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1447 [2025-03-16 15:24:10,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:10,795 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:24:10,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:24:10,795 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:10,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:10,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1004446138, now seen corresponding path program 1 times [2025-03-16 15:24:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:10,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835997489] [2025-03-16 15:24:10,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:10,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:10,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1446 statements into 1 equivalence classes. [2025-03-16 15:24:10,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1446 of 1446 statements. [2025-03-16 15:24:10,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:10,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2311 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 2138 trivial. 0 not checked. [2025-03-16 15:24:11,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:11,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835997489] [2025-03-16 15:24:11,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835997489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:11,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:11,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:11,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435665569] [2025-03-16 15:24:11,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:11,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:11,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:11,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:11,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:11,530 INFO L87 Difference]: Start difference. First operand 63483 states and 66209 transitions. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:12,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:12,944 INFO L93 Difference]: Finished difference Result 126275 states and 131726 transitions. [2025-03-16 15:24:12,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:12,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1446 [2025-03-16 15:24:12,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:13,007 INFO L225 Difference]: With dead ends: 126275 [2025-03-16 15:24:13,007 INFO L226 Difference]: Without dead ends: 63483 [2025-03-16 15:24:13,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:13,048 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 728 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:13,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 886 Invalid, 1825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:24:13,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63483 states. [2025-03-16 15:24:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63483 to 61413. [2025-03-16 15:24:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61413 states, 61412 states have (on average 1.030156972578649) internal successors, (63264), 61412 states have internal predecessors, (63264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61413 states to 61413 states and 63264 transitions. [2025-03-16 15:24:13,755 INFO L78 Accepts]: Start accepts. Automaton has 61413 states and 63264 transitions. Word has length 1446 [2025-03-16 15:24:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:13,756 INFO L471 AbstractCegarLoop]: Abstraction has 61413 states and 63264 transitions. [2025-03-16 15:24:13,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 61413 states and 63264 transitions. [2025-03-16 15:24:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1999 [2025-03-16 15:24:13,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:13,841 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:24:13,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:24:13,842 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:13,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash 973690633, now seen corresponding path program 1 times [2025-03-16 15:24:13,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:13,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934371531] [2025-03-16 15:24:13,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:13,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:13,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1998 statements into 1 equivalence classes. [2025-03-16 15:24:14,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1998 of 1998 statements. [2025-03-16 15:24:14,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:14,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3268 backedges. 1464 proven. 0 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-03-16 15:24:15,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:15,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934371531] [2025-03-16 15:24:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934371531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:15,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:15,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:15,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270889299] [2025-03-16 15:24:15,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:15,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:15,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:15,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:15,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:15,910 INFO L87 Difference]: Start difference. First operand 61413 states and 63264 transitions. Second operand has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:17,228 INFO L93 Difference]: Finished difference Result 132485 states and 136675 transitions. [2025-03-16 15:24:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:17,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1998 [2025-03-16 15:24:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:17,295 INFO L225 Difference]: With dead ends: 132485 [2025-03-16 15:24:17,296 INFO L226 Difference]: Without dead ends: 71763 [2025-03-16 15:24:17,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:17,332 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 340 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:17,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 80 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:24:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71763 states. [2025-03-16 15:24:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71763 to 69693. [2025-03-16 15:24:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69693 states, 69692 states have (on average 1.0303334672559261) internal successors, (71806), 69692 states have internal predecessors, (71806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69693 states to 69693 states and 71806 transitions. [2025-03-16 15:24:17,863 INFO L78 Accepts]: Start accepts. Automaton has 69693 states and 71806 transitions. Word has length 1998 [2025-03-16 15:24:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:17,864 INFO L471 AbstractCegarLoop]: Abstraction has 69693 states and 71806 transitions. [2025-03-16 15:24:17,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 69693 states and 71806 transitions. [2025-03-16 15:24:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2132 [2025-03-16 15:24:17,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:17,918 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:24:17,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:24:17,918 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:17,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:17,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1446679158, now seen corresponding path program 1 times [2025-03-16 15:24:17,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:17,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946751885] [2025-03-16 15:24:17,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:17,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:18,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2131 statements into 1 equivalence classes. [2025-03-16 15:24:18,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2131 of 2131 statements. [2025-03-16 15:24:18,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:18,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3268 backedges. 2400 proven. 48 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-16 15:24:19,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946751885] [2025-03-16 15:24:19,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946751885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:24:19,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081158777] [2025-03-16 15:24:19,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:19,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:24:19,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:24:19,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:24:19,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:24:19,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2131 statements into 1 equivalence classes. [2025-03-16 15:24:19,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2131 of 2131 statements. [2025-03-16 15:24:19,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:19,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:19,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 2358 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:24:19,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:24:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3268 backedges. 2027 proven. 0 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2025-03-16 15:24:20,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:24:20,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081158777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:20,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:24:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:24:20,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026664229] [2025-03-16 15:24:20,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:20,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:20,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:20,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:20,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:24:20,485 INFO L87 Difference]: Start difference. First operand 69693 states and 71806 transitions. Second operand has 3 states, 3 states have (on average 404.0) internal successors, (1212), 3 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:21,917 INFO L93 Difference]: Finished difference Result 138693 states and 142919 transitions. [2025-03-16 15:24:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:21,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 404.0) internal successors, (1212), 3 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2131 [2025-03-16 15:24:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:21,920 INFO L225 Difference]: With dead ends: 138693 [2025-03-16 15:24:21,920 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:24:21,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2135 GetRequests, 2131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:24:21,959 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 103 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:21,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 741 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:24:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:24:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:24:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:24:21,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2131 [2025-03-16 15:24:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:21,961 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:24:21,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.0) internal successors, (1212), 3 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:24:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:24:21,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:24:21,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:24:21,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:24:22,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:24:22,168 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:24:22,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:24:23,820 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:24:23,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:24:23 BoogieIcfgContainer [2025-03-16 15:24:23,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:24:23,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:24:23,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:24:23,839 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:24:23,840 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:23:27" (3/4) ... [2025-03-16 15:24:23,841 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:24:23,883 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-16 15:24:23,887 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:24:23,890 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:24:23,893 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:24:24,086 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:24:24,086 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:24:24,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:24:24,087 INFO L158 Benchmark]: Toolchain (without parser) took 60886.98ms. Allocated memory was 201.3MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 145.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-03-16 15:24:24,087 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:24:24,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 783.84ms. Allocated memory is still 201.3MB. Free memory was 145.2MB in the beginning and 125.7MB in the end (delta: 19.5MB). Peak memory consumption was 122.0MB. Max. memory is 16.1GB. [2025-03-16 15:24:24,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.00ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 83.2MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 15:24:24,087 INFO L158 Benchmark]: Boogie Preprocessor took 227.29ms. Allocated memory is still 201.3MB. Free memory was 83.2MB in the beginning and 99.2MB in the end (delta: -16.0MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2025-03-16 15:24:24,088 INFO L158 Benchmark]: IcfgBuilder took 2761.23ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 98.2MB in the beginning and 75.0MB in the end (delta: 23.2MB). Peak memory consumption was 159.3MB. Max. memory is 16.1GB. [2025-03-16 15:24:24,088 INFO L158 Benchmark]: TraceAbstraction took 56712.12ms. Allocated memory was 318.8MB in the beginning and 3.5GB in the end (delta: 3.2GB). Free memory was 72.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-03-16 15:24:24,088 INFO L158 Benchmark]: Witness Printer took 247.47ms. Allocated memory is still 3.5GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-16 15:24:24,088 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.18ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 783.84ms. Allocated memory is still 201.3MB. Free memory was 145.2MB in the beginning and 125.7MB in the end (delta: 19.5MB). Peak memory consumption was 122.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.00ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 83.2MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 227.29ms. Allocated memory is still 201.3MB. Free memory was 83.2MB in the beginning and 99.2MB in the end (delta: -16.0MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * IcfgBuilder took 2761.23ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 98.2MB in the beginning and 75.0MB in the end (delta: 23.2MB). Peak memory consumption was 159.3MB. Max. memory is 16.1GB. * TraceAbstraction took 56712.12ms. Allocated memory was 318.8MB in the beginning and 3.5GB in the end (delta: 3.2GB). Free memory was 72.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 247.47ms. Allocated memory is still 3.5GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. 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: 112]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 696 locations, 1382 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.0s, OverallIterations: 19, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14027 SdHoareTripleChecker+Valid, 28.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14027 mSDsluCounter, 12065 SdHoareTripleChecker+Invalid, 23.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 8220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40307 IncrementalHoareTripleChecker+Invalid, 48527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8220 mSolverCounterUnsat, 11929 mSDtfsCounter, 40307 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4538 GetRequests, 4496 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69693occurred in iteration=18, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 11775 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 23157 NumberOfCodeBlocks, 23157 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 23135 ConstructedInterpolants, 0 QuantifiedInterpolants, 60896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5091 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 26986/28722 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: 4269]: Location Invariant Derived location invariant: ((((((((((((((((((((((5 == a15) && (a24 <= 3)) && (a24 != 2)) || (((5 == a15) && (a24 <= 3)) && (a18 == 12))) || (((a24 == 0) && (a15 <= 4)) && (a18 == 9))) || (((5 == a15) && (a24 <= 3)) && (a18 == 9))) || (((a24 <= 3) && (a18 == 9)) && (a15 == 6))) || (((5 == a15) && (a18 == 10)) && (a24 == 4))) || (((5 == a15) && (a24 == 4)) && (a3 <= 417))) || (((a24 <= 3) && (a18 == 12)) && (a15 == 6))) || ((a15 <= 4) && (a24 == 4))) || (((a24 == 0) && (a15 <= 4)) && (a18 == 10))) || (((a18 == 10) && (a24 <= 3)) && (a15 == 6))) || (((5 == a15) && (a18 == 10)) && (a24 <= 3))) || (((a24 == 0) && (a18 <= 8)) && (a15 <= 4))) || (((a18 <= 8) && (a24 <= 3)) && (a15 == 6))) || (((a24 <= 3) && (a3 <= 417)) && (a15 == 6))) || (((a15 <= 4) && (a24 <= 3)) && (a24 != 0))) || (((a24 <= 3) && (a15 == 6)) && (a24 != 2))) || (((a24 == 0) && (a15 <= 4)) && (a3 <= 417))) || (((a24 == 0) && (a15 <= 4)) && (a18 == 12))) || (((5 == a15) && (a24 <= 3)) && (a3 <= 417))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:24:24,103 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