./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label56.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 77c0c06cf345be89a7bfdea692ab0197740d9f5ad98baaf39e02029ee2fea03a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:34:02,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:34:02,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:34:02,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:34:02,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:34:02,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:34:02,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:34:02,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:34:02,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:34:02,858 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:34:02,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:34:02,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:34:02,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:34:02,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:34:02,859 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:34:02,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:34:02,860 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:34:02,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:34:02,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:34:02,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:34:02,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:34:02,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:34:02,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:34:02,861 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:34:02,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:34:02,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:34:02,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:34:02,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:34:02,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:34:02,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:34:02,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:34:02,862 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 -> 77c0c06cf345be89a7bfdea692ab0197740d9f5ad98baaf39e02029ee2fea03a [2025-03-03 10:34:03,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:34:03,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:34:03,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:34:03,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:34:03,094 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:34:03,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label56.c [2025-03-03 10:34:04,249 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/737b00540/699ae3eff861405db6f5d4bce2996fc5/FLAG02fd79507 [2025-03-03 10:34:04,561 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:34:04,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label56.c [2025-03-03 10:34:04,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/737b00540/699ae3eff861405db6f5d4bce2996fc5/FLAG02fd79507 [2025-03-03 10:34:04,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/737b00540/699ae3eff861405db6f5d4bce2996fc5 [2025-03-03 10:34:04,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:34:04,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:34:04,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:34:04,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:34:04,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:34:04,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:34:04" (1/1) ... [2025-03-03 10:34:04,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1998856b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:04, skipping insertion in model container [2025-03-03 10:34:04,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:34:04" (1/1) ... [2025-03-03 10:34:04,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:34:05,012 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/Problem11_label56.c[5994,6007] [2025-03-03 10:34:05,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:34:05,225 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:34:05,246 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/Problem11_label56.c[5994,6007] [2025-03-03 10:34:05,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:34:05,360 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:34:05,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05 WrapperNode [2025-03-03 10:34:05,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:34:05,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:34:05,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:34:05,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:34:05,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,473 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-03 10:34:05,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:34:05,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:34:05,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:34:05,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:34:05,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,538 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:34:05,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:34:05,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:34:05,622 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:34:05,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:34:05,623 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (1/1) ... [2025-03-03 10:34:05,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:34:05,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:05,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:34:05,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:34:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:34:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:34:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:34:05,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:34:05,746 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:34:05,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:34:07,071 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-03 10:34:07,072 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:34:07,094 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:34:07,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:34:07,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:34:07 BoogieIcfgContainer [2025-03-03 10:34:07,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:34:07,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:34:07,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:34:07,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:34:07,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:34:04" (1/3) ... [2025-03-03 10:34:07,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401dcd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:34:07, skipping insertion in model container [2025-03-03 10:34:07,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:05" (2/3) ... [2025-03-03 10:34:07,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401dcd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:34:07, skipping insertion in model container [2025-03-03 10:34:07,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:34:07" (3/3) ... [2025-03-03 10:34:07,105 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label56.c [2025-03-03 10:34:07,119 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:34:07,120 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label56.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:34:07,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:34:07,184 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;@72ddd8bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:34:07,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:34:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 10:34:07,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:07,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:07,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:07,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:07,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1332875519, now seen corresponding path program 1 times [2025-03-03 10:34:07,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:07,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418414680] [2025-03-03 10:34:07,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:07,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 10:34:07,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 10:34:07,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:07,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:07,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418414680] [2025-03-03 10:34:07,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418414680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:07,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:07,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:34:07,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128409214] [2025-03-03 10:34:07,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:07,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:07,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:07,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:07,531 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:08,548 INFO L93 Difference]: Finished difference Result 769 states and 1357 transitions. [2025-03-03 10:34:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:08,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-03 10:34:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:08,560 INFO L225 Difference]: With dead ends: 769 [2025-03-03 10:34:08,560 INFO L226 Difference]: Without dead ends: 422 [2025-03-03 10:34:08,564 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-03 10:34:08,566 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 199 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:08,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 164 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:34:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-03 10:34:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2025-03-03 10:34:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2025-03-03 10:34:08,619 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 41 [2025-03-03 10:34:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:08,620 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2025-03-03 10:34:08,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2025-03-03 10:34:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 10:34:08,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:08,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:08,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:34:08,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:08,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1946334330, now seen corresponding path program 1 times [2025-03-03 10:34:08,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:08,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701068137] [2025-03-03 10:34:08,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:08,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 10:34:08,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 10:34:08,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:08,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:08,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:08,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701068137] [2025-03-03 10:34:08,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701068137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:08,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:08,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:34:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101776732] [2025-03-03 10:34:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:08,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:08,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:08,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:08,863 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:09,555 INFO L93 Difference]: Finished difference Result 1199 states and 1829 transitions. [2025-03-03 10:34:09,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:09,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-03 10:34:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:09,559 INFO L225 Difference]: With dead ends: 1199 [2025-03-03 10:34:09,559 INFO L226 Difference]: Without dead ends: 789 [2025-03-03 10:34:09,560 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-03 10:34:09,560 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:09,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 176 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:34:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-03 10:34:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-03-03 10:34:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-03-03 10:34:09,591 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 107 [2025-03-03 10:34:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:09,591 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-03-03 10:34:09,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-03-03 10:34:09,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 10:34:09,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:09,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:09,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:34:09,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:09,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1130938192, now seen corresponding path program 1 times [2025-03-03 10:34:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:09,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242689984] [2025-03-03 10:34:09,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:09,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 10:34:09,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 10:34:09,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:09,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:09,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:09,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242689984] [2025-03-03 10:34:09,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242689984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:09,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:09,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:34:09,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789207976] [2025-03-03 10:34:09,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:09,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:09,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:09,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:09,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:09,894 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:10,502 INFO L93 Difference]: Finished difference Result 2314 states and 3181 transitions. [2025-03-03 10:34:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:10,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-03 10:34:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:10,508 INFO L225 Difference]: With dead ends: 2314 [2025-03-03 10:34:10,508 INFO L226 Difference]: Without dead ends: 1527 [2025-03-03 10:34:10,509 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-03 10:34:10,509 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:10,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-03-03 10:34:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2025-03-03 10:34:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.217049180327869) internal successors, (1856), 1525 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1856 transitions. [2025-03-03 10:34:10,535 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1856 transitions. Word has length 111 [2025-03-03 10:34:10,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:10,536 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1856 transitions. [2025-03-03 10:34:10,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1856 transitions. [2025-03-03 10:34:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 10:34:10,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:10,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:10,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:34:10,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:10,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1172055455, now seen corresponding path program 1 times [2025-03-03 10:34:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:10,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137685431] [2025-03-03 10:34:10,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:10,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:10,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 10:34:10,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 10:34:10,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:10,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:10,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:10,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137685431] [2025-03-03 10:34:10,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137685431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:10,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:10,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:10,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700919325] [2025-03-03 10:34:10,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:10,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:10,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:10,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:10,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:10,732 INFO L87 Difference]: Start difference. First operand 1526 states and 1856 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:11,387 INFO L93 Difference]: Finished difference Result 3614 states and 4469 transitions. [2025-03-03 10:34:11,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:11,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-03 10:34:11,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:11,395 INFO L225 Difference]: With dead ends: 3614 [2025-03-03 10:34:11,395 INFO L226 Difference]: Without dead ends: 2274 [2025-03-03 10:34:11,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:11,398 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 164 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:11,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 336 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2025-03-03 10:34:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1897. [2025-03-03 10:34:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1896 states have (on average 1.215717299578059) internal successors, (2305), 1896 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2305 transitions. [2025-03-03 10:34:11,433 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2305 transitions. Word has length 168 [2025-03-03 10:34:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:11,433 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2305 transitions. [2025-03-03 10:34:11,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2305 transitions. [2025-03-03 10:34:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 10:34:11,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:11,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:11,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:34:11,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:11,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:11,437 INFO L85 PathProgramCache]: Analyzing trace with hash 466323698, now seen corresponding path program 1 times [2025-03-03 10:34:11,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:11,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044608097] [2025-03-03 10:34:11,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:11,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 10:34:11,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 10:34:11,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:11,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 10:34:11,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:11,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044608097] [2025-03-03 10:34:11,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044608097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:11,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919486676] [2025-03-03 10:34:11,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:11,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:11,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:11,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:11,658 INFO L87 Difference]: Start difference. First operand 1897 states and 2305 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:12,303 INFO L93 Difference]: Finished difference Result 4529 states and 5604 transitions. [2025-03-03 10:34:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:12,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 223 [2025-03-03 10:34:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:12,310 INFO L225 Difference]: With dead ends: 4529 [2025-03-03 10:34:12,311 INFO L226 Difference]: Without dead ends: 2449 [2025-03-03 10:34:12,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:12,313 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 181 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:12,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 324 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2025-03-03 10:34:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2449. [2025-03-03 10:34:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 2448 states have (on average 1.2336601307189543) internal successors, (3020), 2448 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3020 transitions. [2025-03-03 10:34:12,344 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3020 transitions. Word has length 223 [2025-03-03 10:34:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:12,345 INFO L471 AbstractCegarLoop]: Abstraction has 2449 states and 3020 transitions. [2025-03-03 10:34:12,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3020 transitions. [2025-03-03 10:34:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-03 10:34:12,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:12,347 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:12,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:34:12,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:12,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash -357804037, now seen corresponding path program 1 times [2025-03-03 10:34:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:12,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946436152] [2025-03-03 10:34:12,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:12,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-03 10:34:12,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-03 10:34:12,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:12,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 10:34:12,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:12,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946436152] [2025-03-03 10:34:12,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946436152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:12,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:12,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:12,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972921411] [2025-03-03 10:34:12,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:12,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:12,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:12,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:12,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:12,546 INFO L87 Difference]: Start difference. First operand 2449 states and 3020 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:13,182 INFO L93 Difference]: Finished difference Result 5636 states and 7040 transitions. [2025-03-03 10:34:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 250 [2025-03-03 10:34:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:13,190 INFO L225 Difference]: With dead ends: 5636 [2025-03-03 10:34:13,190 INFO L226 Difference]: Without dead ends: 3189 [2025-03-03 10:34:13,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:13,194 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:13,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 382 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2025-03-03 10:34:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3184. [2025-03-03 10:34:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3183 states have (on average 1.2145774426641534) internal successors, (3866), 3183 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 3866 transitions. [2025-03-03 10:34:13,238 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 3866 transitions. Word has length 250 [2025-03-03 10:34:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:13,238 INFO L471 AbstractCegarLoop]: Abstraction has 3184 states and 3866 transitions. [2025-03-03 10:34:13,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 3866 transitions. [2025-03-03 10:34:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 10:34:13,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:13,243 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:13,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:34:13,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:13,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash 423460518, now seen corresponding path program 1 times [2025-03-03 10:34:13,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:13,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971224908] [2025-03-03 10:34:13,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:13,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:13,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 10:34:13,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 10:34:13,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:13,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:13,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:13,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971224908] [2025-03-03 10:34:13,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971224908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:13,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:13,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:13,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195391062] [2025-03-03 10:34:13,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:13,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:13,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:13,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:13,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:13,607 INFO L87 Difference]: Start difference. First operand 3184 states and 3866 transitions. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:14,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:14,687 INFO L93 Difference]: Finished difference Result 10428 states and 12957 transitions. [2025-03-03 10:34:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:14,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-03-03 10:34:14,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:14,708 INFO L225 Difference]: With dead ends: 10428 [2025-03-03 10:34:14,708 INFO L226 Difference]: Without dead ends: 7245 [2025-03-03 10:34:14,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:14,714 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 223 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:14,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 125 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:34:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7245 states. [2025-03-03 10:34:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7245 to 7240. [2025-03-03 10:34:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7240 states, 7239 states have (on average 1.2113551595524243) internal successors, (8769), 7239 states have internal predecessors, (8769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7240 states to 7240 states and 8769 transitions. [2025-03-03 10:34:14,814 INFO L78 Accepts]: Start accepts. Automaton has 7240 states and 8769 transitions. Word has length 272 [2025-03-03 10:34:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:14,815 INFO L471 AbstractCegarLoop]: Abstraction has 7240 states and 8769 transitions. [2025-03-03 10:34:14,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 7240 states and 8769 transitions. [2025-03-03 10:34:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-03 10:34:14,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:14,821 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:34:14,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:34:14,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:14,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1290230548, now seen corresponding path program 1 times [2025-03-03 10:34:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:14,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808019649] [2025-03-03 10:34:14,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:14,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-03 10:34:14,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-03 10:34:14,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:14,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:15,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:15,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808019649] [2025-03-03 10:34:15,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808019649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:15,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:15,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:15,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600380481] [2025-03-03 10:34:15,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:15,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:15,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:15,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:15,060 INFO L87 Difference]: Start difference. First operand 7240 states and 8769 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:15,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:15,670 INFO L93 Difference]: Finished difference Result 16896 states and 20632 transitions. [2025-03-03 10:34:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:15,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 315 [2025-03-03 10:34:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:15,699 INFO L225 Difference]: With dead ends: 16896 [2025-03-03 10:34:15,699 INFO L226 Difference]: Without dead ends: 10027 [2025-03-03 10:34:15,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:15,710 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 85 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:15,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 369 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:34:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10027 states. [2025-03-03 10:34:15,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10027 to 10024. [2025-03-03 10:34:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10024 states, 10023 states have (on average 1.2144068642123116) internal successors, (12172), 10023 states have internal predecessors, (12172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10024 states to 10024 states and 12172 transitions. [2025-03-03 10:34:15,861 INFO L78 Accepts]: Start accepts. Automaton has 10024 states and 12172 transitions. Word has length 315 [2025-03-03 10:34:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:15,861 INFO L471 AbstractCegarLoop]: Abstraction has 10024 states and 12172 transitions. [2025-03-03 10:34:15,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 10024 states and 12172 transitions. [2025-03-03 10:34:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-03 10:34:15,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:15,871 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:34:15,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:34:15,872 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1044594036, now seen corresponding path program 1 times [2025-03-03 10:34:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632091850] [2025-03-03 10:34:15,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:15,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-03 10:34:15,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-03 10:34:15,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:15,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-03 10:34:16,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:16,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632091850] [2025-03-03 10:34:16,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632091850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:16,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:16,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534546646] [2025-03-03 10:34:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:16,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:16,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:16,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:16,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:16,097 INFO L87 Difference]: Start difference. First operand 10024 states and 12172 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:16,757 INFO L93 Difference]: Finished difference Result 23732 states and 29194 transitions. [2025-03-03 10:34:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:16,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 323 [2025-03-03 10:34:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:16,783 INFO L225 Difference]: With dead ends: 23732 [2025-03-03 10:34:16,783 INFO L226 Difference]: Without dead ends: 14079 [2025-03-03 10:34:16,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:16,796 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 193 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:16,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 99 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14079 states. [2025-03-03 10:34:16,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14079 to 14073. [2025-03-03 10:34:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14073 states, 14072 states have (on average 1.2237066515065378) internal successors, (17220), 14072 states have internal predecessors, (17220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14073 states to 14073 states and 17220 transitions. [2025-03-03 10:34:16,929 INFO L78 Accepts]: Start accepts. Automaton has 14073 states and 17220 transitions. Word has length 323 [2025-03-03 10:34:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:16,930 INFO L471 AbstractCegarLoop]: Abstraction has 14073 states and 17220 transitions. [2025-03-03 10:34:16,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 14073 states and 17220 transitions. [2025-03-03 10:34:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-03 10:34:16,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:16,937 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:34:16,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:34:16,937 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:16,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash 834629754, now seen corresponding path program 1 times [2025-03-03 10:34:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:16,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016382552] [2025-03-03 10:34:16,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:16,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:16,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-03 10:34:16,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-03 10:34:16,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:16,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:34:17,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:17,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016382552] [2025-03-03 10:34:17,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016382552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:17,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:17,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:17,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513632146] [2025-03-03 10:34:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:17,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:17,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:17,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:17,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:17,199 INFO L87 Difference]: Start difference. First operand 14073 states and 17220 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:17,887 INFO L93 Difference]: Finished difference Result 29806 states and 36748 transitions. [2025-03-03 10:34:17,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:17,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 329 [2025-03-03 10:34:17,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:17,913 INFO L225 Difference]: With dead ends: 29806 [2025-03-03 10:34:17,914 INFO L226 Difference]: Without dead ends: 16104 [2025-03-03 10:34:17,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:17,927 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 182 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:17,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 159 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2025-03-03 10:34:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 14073. [2025-03-03 10:34:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14073 states, 14072 states have (on average 1.2237066515065378) internal successors, (17220), 14072 states have internal predecessors, (17220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14073 states to 14073 states and 17220 transitions. [2025-03-03 10:34:18,071 INFO L78 Accepts]: Start accepts. Automaton has 14073 states and 17220 transitions. Word has length 329 [2025-03-03 10:34:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:18,072 INFO L471 AbstractCegarLoop]: Abstraction has 14073 states and 17220 transitions. [2025-03-03 10:34:18,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 14073 states and 17220 transitions. [2025-03-03 10:34:18,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 10:34:18,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:18,080 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:18,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:34:18,080 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:18,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2051206487, now seen corresponding path program 1 times [2025-03-03 10:34:18,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:18,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304434997] [2025-03-03 10:34:18,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:18,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 10:34:18,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 10:34:18,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:18,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 10:34:18,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:18,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304434997] [2025-03-03 10:34:18,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304434997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:18,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:18,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:18,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204107576] [2025-03-03 10:34:18,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:18,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:18,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:18,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:18,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:18,303 INFO L87 Difference]: Start difference. First operand 14073 states and 17220 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:18,944 INFO L93 Difference]: Finished difference Result 30740 states and 37768 transitions. [2025-03-03 10:34:18,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:18,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 339 [2025-03-03 10:34:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:18,972 INFO L225 Difference]: With dead ends: 30740 [2025-03-03 10:34:18,972 INFO L226 Difference]: Without dead ends: 17038 [2025-03-03 10:34:18,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:18,986 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 140 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:18,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 113 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17038 states. [2025-03-03 10:34:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17038 to 17034. [2025-03-03 10:34:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17034 states, 17033 states have (on average 1.2164034521223508) internal successors, (20719), 17033 states have internal predecessors, (20719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17034 states to 17034 states and 20719 transitions. [2025-03-03 10:34:19,193 INFO L78 Accepts]: Start accepts. Automaton has 17034 states and 20719 transitions. Word has length 339 [2025-03-03 10:34:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:19,194 INFO L471 AbstractCegarLoop]: Abstraction has 17034 states and 20719 transitions. [2025-03-03 10:34:19,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 17034 states and 20719 transitions. [2025-03-03 10:34:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-03 10:34:19,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:19,203 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:19,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:34:19,203 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:19,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1893901286, now seen corresponding path program 1 times [2025-03-03 10:34:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:19,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318977085] [2025-03-03 10:34:19,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:19,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:19,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-03 10:34:19,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-03 10:34:19,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:19,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 10:34:19,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:19,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318977085] [2025-03-03 10:34:19,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318977085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:19,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:19,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:19,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803034430] [2025-03-03 10:34:19,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:19,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:19,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:19,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:19,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:19,322 INFO L87 Difference]: Start difference. First operand 17034 states and 20719 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:19,854 INFO L93 Difference]: Finished difference Result 31641 states and 38568 transitions. [2025-03-03 10:34:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:19,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 345 [2025-03-03 10:34:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:19,874 INFO L225 Difference]: With dead ends: 31641 [2025-03-03 10:34:19,874 INFO L226 Difference]: Without dead ends: 14978 [2025-03-03 10:34:19,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:19,886 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 137 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:19,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 145 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:34:19,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14978 states. [2025-03-03 10:34:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14978 to 12571. [2025-03-03 10:34:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12571 states, 12570 states have (on average 1.1497215592680987) internal successors, (14452), 12570 states have internal predecessors, (14452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12571 states to 12571 states and 14452 transitions. [2025-03-03 10:34:20,043 INFO L78 Accepts]: Start accepts. Automaton has 12571 states and 14452 transitions. Word has length 345 [2025-03-03 10:34:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:20,043 INFO L471 AbstractCegarLoop]: Abstraction has 12571 states and 14452 transitions. [2025-03-03 10:34:20,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 12571 states and 14452 transitions. [2025-03-03 10:34:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-03 10:34:20,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:20,049 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:20,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:34:20,049 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:20,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2085935216, now seen corresponding path program 1 times [2025-03-03 10:34:20,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:20,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188052442] [2025-03-03 10:34:20,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:20,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:20,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-03 10:34:20,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-03 10:34:20,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:20,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:20,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:20,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188052442] [2025-03-03 10:34:20,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188052442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:20,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:20,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:34:20,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324131123] [2025-03-03 10:34:20,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:20,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:20,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:20,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:20,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:20,517 INFO L87 Difference]: Start difference. First operand 12571 states and 14452 transitions. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:21,513 INFO L93 Difference]: Finished difference Result 28463 states and 32717 transitions. [2025-03-03 10:34:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:21,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 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 349 [2025-03-03 10:34:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:21,531 INFO L225 Difference]: With dead ends: 28463 [2025-03-03 10:34:21,532 INFO L226 Difference]: Without dead ends: 16262 [2025-03-03 10:34:21,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:21,541 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 252 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:21,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 90 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:34:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16262 states. [2025-03-03 10:34:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16262 to 13863. [2025-03-03 10:34:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13863 states, 13862 states have (on average 1.1390852690809408) internal successors, (15790), 13862 states have internal predecessors, (15790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13863 states to 13863 states and 15790 transitions. [2025-03-03 10:34:21,668 INFO L78 Accepts]: Start accepts. Automaton has 13863 states and 15790 transitions. Word has length 349 [2025-03-03 10:34:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:21,669 INFO L471 AbstractCegarLoop]: Abstraction has 13863 states and 15790 transitions. [2025-03-03 10:34:21,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 13863 states and 15790 transitions. [2025-03-03 10:34:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-03 10:34:21,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:21,676 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:21,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:34:21,676 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:21,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 59508344, now seen corresponding path program 1 times [2025-03-03 10:34:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510752579] [2025-03-03 10:34:21,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:21,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-03 10:34:21,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-03 10:34:21,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:21,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 10:34:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510752579] [2025-03-03 10:34:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510752579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404941644] [2025-03-03 10:34:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:21,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:21,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:21,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:21,975 INFO L87 Difference]: Start difference. First operand 13863 states and 15790 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:22,725 INFO L93 Difference]: Finished difference Result 29384 states and 33433 transitions. [2025-03-03 10:34:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:22,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 392 [2025-03-03 10:34:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:22,740 INFO L225 Difference]: With dead ends: 29384 [2025-03-03 10:34:22,740 INFO L226 Difference]: Without dead ends: 15155 [2025-03-03 10:34:22,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:22,749 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 189 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:22,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 175 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:34:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15155 states. [2025-03-03 10:34:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15155 to 14967. [2025-03-03 10:34:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14967 states, 14966 states have (on average 1.1247494320459708) internal successors, (16833), 14966 states have internal predecessors, (16833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14967 states to 14967 states and 16833 transitions. [2025-03-03 10:34:22,871 INFO L78 Accepts]: Start accepts. Automaton has 14967 states and 16833 transitions. Word has length 392 [2025-03-03 10:34:22,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:22,871 INFO L471 AbstractCegarLoop]: Abstraction has 14967 states and 16833 transitions. [2025-03-03 10:34:22,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 14967 states and 16833 transitions. [2025-03-03 10:34:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-03 10:34:22,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:22,878 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:22,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:34:22,878 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:22,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:22,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2017001349, now seen corresponding path program 1 times [2025-03-03 10:34:22,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:22,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245455260] [2025-03-03 10:34:22,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:22,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-03 10:34:22,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-03 10:34:22,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:22,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:23,020 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-03 10:34:23,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:23,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245455260] [2025-03-03 10:34:23,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245455260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:23,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:23,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:23,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384261187] [2025-03-03 10:34:23,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:23,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:23,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:23,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:23,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:23,021 INFO L87 Difference]: Start difference. First operand 14967 states and 16833 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:23,589 INFO L93 Difference]: Finished difference Result 31403 states and 35336 transitions. [2025-03-03 10:34:23,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:23,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 394 [2025-03-03 10:34:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:23,609 INFO L225 Difference]: With dead ends: 31403 [2025-03-03 10:34:23,609 INFO L226 Difference]: Without dead ends: 16806 [2025-03-03 10:34:23,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:23,621 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 178 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:23,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 140 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:34:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16806 states. [2025-03-03 10:34:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16806 to 10546. [2025-03-03 10:34:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10546 states, 10545 states have (on average 1.1315315315315315) internal successors, (11932), 10545 states have internal predecessors, (11932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10546 states to 10546 states and 11932 transitions. [2025-03-03 10:34:23,731 INFO L78 Accepts]: Start accepts. Automaton has 10546 states and 11932 transitions. Word has length 394 [2025-03-03 10:34:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:23,731 INFO L471 AbstractCegarLoop]: Abstraction has 10546 states and 11932 transitions. [2025-03-03 10:34:23,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10546 states and 11932 transitions. [2025-03-03 10:34:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-03 10:34:23,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:23,738 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:23,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:34:23,738 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:23,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:23,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1241718667, now seen corresponding path program 1 times [2025-03-03 10:34:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:23,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640423022] [2025-03-03 10:34:23,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:23,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:23,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-03 10:34:23,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-03 10:34:23,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:23,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 10:34:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:23,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640423022] [2025-03-03 10:34:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640423022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:23,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297041788] [2025-03-03 10:34:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:23,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:23,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:23,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:23,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:23,959 INFO L87 Difference]: Start difference. First operand 10546 states and 11932 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-03 10:34:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:24,873 INFO L93 Difference]: Finished difference Result 27365 states and 30900 transitions. [2025-03-03 10:34:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:24,873 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 413 [2025-03-03 10:34:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:24,899 INFO L225 Difference]: With dead ends: 27365 [2025-03-03 10:34:24,899 INFO L226 Difference]: Without dead ends: 17189 [2025-03-03 10:34:24,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:24,910 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 207 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:24,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 82 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:34:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17189 states. [2025-03-03 10:34:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17189 to 17004. [2025-03-03 10:34:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17004 states, 17003 states have (on average 1.1229194847968005) internal successors, (19093), 17003 states have internal predecessors, (19093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17004 states to 17004 states and 19093 transitions. [2025-03-03 10:34:25,064 INFO L78 Accepts]: Start accepts. Automaton has 17004 states and 19093 transitions. Word has length 413 [2025-03-03 10:34:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:25,064 INFO L471 AbstractCegarLoop]: Abstraction has 17004 states and 19093 transitions. [2025-03-03 10:34:25,064 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-03 10:34:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 17004 states and 19093 transitions. [2025-03-03 10:34:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-03-03 10:34:25,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:25,079 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:25,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:34:25,079 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:25,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash -595881850, now seen corresponding path program 1 times [2025-03-03 10:34:25,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:25,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304131128] [2025-03-03 10:34:25,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:25,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:25,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-03 10:34:25,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-03 10:34:25,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:25,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 456 proven. 34 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-03 10:34:25,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304131128] [2025-03-03 10:34:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304131128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:34:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265582633] [2025-03-03 10:34:25,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:25,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:25,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:25,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:34:25,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:34:25,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-03 10:34:25,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-03 10:34:25,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:25,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:25,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:34:25,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:34:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 490 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-03 10:34:26,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:34:26,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265582633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:26,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:34:26,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:34:26,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24365468] [2025-03-03 10:34:26,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:26,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:26,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:26,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:26,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:34:26,020 INFO L87 Difference]: Start difference. First operand 17004 states and 19093 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:26,596 INFO L93 Difference]: Finished difference Result 34203 states and 38479 transitions. [2025-03-03 10:34:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:26,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 510 [2025-03-03 10:34:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:26,613 INFO L225 Difference]: With dead ends: 34203 [2025-03-03 10:34:26,614 INFO L226 Difference]: Without dead ends: 17569 [2025-03-03 10:34:26,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:34:26,624 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:26,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 75 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:34:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17569 states. [2025-03-03 10:34:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17569 to 17556. [2025-03-03 10:34:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17556 states, 17555 states have (on average 1.1219025918541725) internal successors, (19695), 17555 states have internal predecessors, (19695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17556 states to 17556 states and 19695 transitions. [2025-03-03 10:34:26,791 INFO L78 Accepts]: Start accepts. Automaton has 17556 states and 19695 transitions. Word has length 510 [2025-03-03 10:34:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:26,792 INFO L471 AbstractCegarLoop]: Abstraction has 17556 states and 19695 transitions. [2025-03-03 10:34:26,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 17556 states and 19695 transitions. [2025-03-03 10:34:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-03-03 10:34:26,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:26,804 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:26,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:34:27,005 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,SelfDestructingSolverStorable16 [2025-03-03 10:34:27,005 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:27,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:27,009 INFO L85 PathProgramCache]: Analyzing trace with hash -613943851, now seen corresponding path program 1 times [2025-03-03 10:34:27,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:27,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627478623] [2025-03-03 10:34:27,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:27,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:27,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-03-03 10:34:27,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-03-03 10:34:27,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:27,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-03 10:34:27,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627478623] [2025-03-03 10:34:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627478623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:27,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:27,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:27,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574627418] [2025-03-03 10:34:27,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:27,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:27,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:27,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:27,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:27,308 INFO L87 Difference]: Start difference. First operand 17556 states and 19695 transitions. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:28,184 INFO L93 Difference]: Finished difference Result 41390 states and 46476 transitions. [2025-03-03 10:34:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:28,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 511 [2025-03-03 10:34:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:28,219 INFO L225 Difference]: With dead ends: 41390 [2025-03-03 10:34:28,220 INFO L226 Difference]: Without dead ends: 23836 [2025-03-03 10:34:28,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:28,230 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 209 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:28,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 87 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:34:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23836 states. [2025-03-03 10:34:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23836 to 17930. [2025-03-03 10:34:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17930 states, 17929 states have (on average 1.1238775168721067) internal successors, (20150), 17929 states have internal predecessors, (20150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17930 states to 17930 states and 20150 transitions. [2025-03-03 10:34:28,387 INFO L78 Accepts]: Start accepts. Automaton has 17930 states and 20150 transitions. Word has length 511 [2025-03-03 10:34:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:28,387 INFO L471 AbstractCegarLoop]: Abstraction has 17930 states and 20150 transitions. [2025-03-03 10:34:28,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 17930 states and 20150 transitions. [2025-03-03 10:34:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-03-03 10:34:28,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:28,399 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:28,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:34:28,399 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:28,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1454217256, now seen corresponding path program 1 times [2025-03-03 10:34:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:28,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462882606] [2025-03-03 10:34:28,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:28,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-03 10:34:28,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-03 10:34:28,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:28,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 877 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:34:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462882606] [2025-03-03 10:34:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462882606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:28,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:28,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825179107] [2025-03-03 10:34:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:28,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:28,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:28,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:28,792 INFO L87 Difference]: Start difference. First operand 17930 states and 20150 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:29,345 INFO L93 Difference]: Finished difference Result 37341 states and 41932 transitions. [2025-03-03 10:34:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:29,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 607 [2025-03-03 10:34:29,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:29,377 INFO L225 Difference]: With dead ends: 37341 [2025-03-03 10:34:29,378 INFO L226 Difference]: Without dead ends: 19781 [2025-03-03 10:34:29,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:29,389 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:29,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 127 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:34:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19781 states. [2025-03-03 10:34:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19781 to 17746. [2025-03-03 10:34:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17746 states, 17745 states have (on average 1.1239222316145394) internal successors, (19944), 17745 states have internal predecessors, (19944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17746 states to 17746 states and 19944 transitions. [2025-03-03 10:34:29,557 INFO L78 Accepts]: Start accepts. Automaton has 17746 states and 19944 transitions. Word has length 607 [2025-03-03 10:34:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:29,557 INFO L471 AbstractCegarLoop]: Abstraction has 17746 states and 19944 transitions. [2025-03-03 10:34:29,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 17746 states and 19944 transitions. [2025-03-03 10:34:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2025-03-03 10:34:29,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:29,572 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:29,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:34:29,572 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:29,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1841277117, now seen corresponding path program 1 times [2025-03-03 10:34:29,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:29,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804649558] [2025-03-03 10:34:29,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:29,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:29,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 635 statements into 1 equivalence classes. [2025-03-03 10:34:29,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 635 of 635 statements. [2025-03-03 10:34:29,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:29,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-03 10:34:29,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:29,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804649558] [2025-03-03 10:34:29,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804649558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:29,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:29,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881544795] [2025-03-03 10:34:29,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:29,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:29,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:29,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:29,757 INFO L87 Difference]: Start difference. First operand 17746 states and 19944 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:30,329 INFO L93 Difference]: Finished difference Result 36961 states and 41584 transitions. [2025-03-03 10:34:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:30,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 635 [2025-03-03 10:34:30,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:30,350 INFO L225 Difference]: With dead ends: 36961 [2025-03-03 10:34:30,351 INFO L226 Difference]: Without dead ends: 19585 [2025-03-03 10:34:30,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:30,362 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:30,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 347 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:34:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19585 states. [2025-03-03 10:34:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19585 to 16259. [2025-03-03 10:34:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16259 states, 16258 states have (on average 1.1198179357854594) internal successors, (18206), 16258 states have internal predecessors, (18206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16259 states to 16259 states and 18206 transitions. [2025-03-03 10:34:30,591 INFO L78 Accepts]: Start accepts. Automaton has 16259 states and 18206 transitions. Word has length 635 [2025-03-03 10:34:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:30,592 INFO L471 AbstractCegarLoop]: Abstraction has 16259 states and 18206 transitions. [2025-03-03 10:34:30,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 16259 states and 18206 transitions. [2025-03-03 10:34:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-03-03 10:34:30,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:30,615 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:30,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:34:30,615 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:30,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 193386927, now seen corresponding path program 1 times [2025-03-03 10:34:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:30,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516200869] [2025-03-03 10:34:30,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:30,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:30,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-03 10:34:30,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-03 10:34:30,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:30,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-03 10:34:31,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:31,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516200869] [2025-03-03 10:34:31,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516200869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:31,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:31,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:34:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846652808] [2025-03-03 10:34:31,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:31,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:34:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:31,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:34:31,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:34:31,608 INFO L87 Difference]: Start difference. First operand 16259 states and 18206 transitions. Second operand has 7 states, 7 states have (on average 59.0) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:32,668 INFO L93 Difference]: Finished difference Result 38969 states and 43538 transitions. [2025-03-03 10:34:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:34:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 59.0) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 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 662 [2025-03-03 10:34:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:32,693 INFO L225 Difference]: With dead ends: 38969 [2025-03-03 10:34:32,694 INFO L226 Difference]: Without dead ends: 23080 [2025-03-03 10:34:32,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:34:32,706 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 237 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:32,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 211 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1923 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:34:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23080 states. [2025-03-03 10:34:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23080 to 23072. [2025-03-03 10:34:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23072 states, 23071 states have (on average 1.1136491699536215) internal successors, (25693), 23071 states have internal predecessors, (25693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23072 states to 23072 states and 25693 transitions. [2025-03-03 10:34:32,932 INFO L78 Accepts]: Start accepts. Automaton has 23072 states and 25693 transitions. Word has length 662 [2025-03-03 10:34:32,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:32,932 INFO L471 AbstractCegarLoop]: Abstraction has 23072 states and 25693 transitions. [2025-03-03 10:34:32,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.0) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:32,932 INFO L276 IsEmpty]: Start isEmpty. Operand 23072 states and 25693 transitions. [2025-03-03 10:34:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-03-03 10:34:32,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:32,947 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:32,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:34:32,948 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:32,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:32,948 INFO L85 PathProgramCache]: Analyzing trace with hash -174363846, now seen corresponding path program 1 times [2025-03-03 10:34:32,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:32,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172155534] [2025-03-03 10:34:32,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:32,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-03-03 10:34:33,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-03-03 10:34:33,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:33,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 1119 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-03-03 10:34:33,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172155534] [2025-03-03 10:34:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172155534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:33,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:33,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:33,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542717443] [2025-03-03 10:34:33,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:33,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:33,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:33,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:33,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:33,282 INFO L87 Difference]: Start difference. First operand 23072 states and 25693 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:33,849 INFO L93 Difference]: Finished difference Result 48165 states and 53643 transitions. [2025-03-03 10:34:33,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:33,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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 670 [2025-03-03 10:34:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:33,877 INFO L225 Difference]: With dead ends: 48165 [2025-03-03 10:34:33,877 INFO L226 Difference]: Without dead ends: 25463 [2025-03-03 10:34:33,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:33,892 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 123 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:33,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 318 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:34:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25463 states. [2025-03-03 10:34:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25463 to 15706. [2025-03-03 10:34:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15706 states, 15705 states have (on average 1.1134670487106018) internal successors, (17487), 15705 states have internal predecessors, (17487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15706 states to 15706 states and 17487 transitions. [2025-03-03 10:34:34,134 INFO L78 Accepts]: Start accepts. Automaton has 15706 states and 17487 transitions. Word has length 670 [2025-03-03 10:34:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:34,134 INFO L471 AbstractCegarLoop]: Abstraction has 15706 states and 17487 transitions. [2025-03-03 10:34:34,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 15706 states and 17487 transitions. [2025-03-03 10:34:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-03-03 10:34:34,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:34,145 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:34,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:34:34,145 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:34,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:34,145 INFO L85 PathProgramCache]: Analyzing trace with hash -820596522, now seen corresponding path program 1 times [2025-03-03 10:34:34,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868004971] [2025-03-03 10:34:34,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:34,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 672 statements into 1 equivalence classes. [2025-03-03 10:34:34,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 672 of 672 statements. [2025-03-03 10:34:34,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:34,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 859 proven. 8 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-03 10:34:35,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:35,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868004971] [2025-03-03 10:34:35,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868004971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:34:35,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471358445] [2025-03-03 10:34:35,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:35,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:35,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:35,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:34:35,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:34:35,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 672 statements into 1 equivalence classes. [2025-03-03 10:34:35,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 672 of 672 statements. [2025-03-03 10:34:35,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:35,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:35,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:34:35,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:34:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 746 proven. 121 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-03 10:34:36,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:34:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 746 proven. 121 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-03 10:34:38,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471358445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:34:38,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:34:38,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-03-03 10:34:38,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257585863] [2025-03-03 10:34:38,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:34:38,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 10:34:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:38,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 10:34:38,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:34:38,744 INFO L87 Difference]: Start difference. First operand 15706 states and 17487 transitions. Second operand has 11 states, 11 states have (on average 90.0909090909091) internal successors, (991), 10 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:41,574 INFO L93 Difference]: Finished difference Result 38047 states and 42117 transitions. [2025-03-03 10:34:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 10:34:41,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 90.0909090909091) internal successors, (991), 10 states have internal predecessors, (991), 0 states have call successors, (0), 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 672 [2025-03-03 10:34:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:41,596 INFO L225 Difference]: With dead ends: 38047 [2025-03-03 10:34:41,596 INFO L226 Difference]: Without dead ends: 22524 [2025-03-03 10:34:41,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1366 GetRequests, 1341 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2025-03-03 10:34:41,603 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1580 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3622 mSolverCounterSat, 612 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 4234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 612 IncrementalHoareTripleChecker+Valid, 3622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:41,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 171 Invalid, 4234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [612 Valid, 3622 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:34:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22524 states. [2025-03-03 10:34:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22524 to 14044. [2025-03-03 10:34:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14044 states, 14043 states have (on average 1.0786156804101688) internal successors, (15147), 14043 states have internal predecessors, (15147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14044 states to 14044 states and 15147 transitions. [2025-03-03 10:34:41,758 INFO L78 Accepts]: Start accepts. Automaton has 14044 states and 15147 transitions. Word has length 672 [2025-03-03 10:34:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:41,759 INFO L471 AbstractCegarLoop]: Abstraction has 14044 states and 15147 transitions. [2025-03-03 10:34:41,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.0909090909091) internal successors, (991), 10 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 14044 states and 15147 transitions. [2025-03-03 10:34:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-03-03 10:34:41,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:41,768 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:41,775 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-03 10:34:41,970 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,SelfDestructingSolverStorable22 [2025-03-03 10:34:41,971 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:41,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash -947012181, now seen corresponding path program 1 times [2025-03-03 10:34:41,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:41,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764147240] [2025-03-03 10:34:41,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:41,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:42,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-03-03 10:34:42,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-03-03 10:34:42,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:42,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 1039 proven. 64 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-03 10:34:42,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:42,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764147240] [2025-03-03 10:34:42,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764147240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:34:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340491586] [2025-03-03 10:34:42,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:42,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:42,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:42,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:34:42,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:34:42,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-03-03 10:34:42,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-03-03 10:34:42,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:42,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:42,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:34:42,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:34:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 1103 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-03 10:34:42,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:34:42,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340491586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:42,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:34:42,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:34:42,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203211727] [2025-03-03 10:34:42,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:42,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:42,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:42,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:42,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:34:42,695 INFO L87 Difference]: Start difference. First operand 14044 states and 15147 transitions. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:43,152 INFO L93 Difference]: Finished difference Result 28465 states and 30700 transitions. [2025-03-03 10:34:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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 687 [2025-03-03 10:34:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:43,166 INFO L225 Difference]: With dead ends: 28465 [2025-03-03 10:34:43,166 INFO L226 Difference]: Without dead ends: 14791 [2025-03-03 10:34:43,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:34:43,175 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 78 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:43,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 338 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:34:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14791 states. [2025-03-03 10:34:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14791 to 13860. [2025-03-03 10:34:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13860 states, 13859 states have (on average 1.077206147629699) internal successors, (14929), 13859 states have internal predecessors, (14929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13860 states to 13860 states and 14929 transitions. [2025-03-03 10:34:43,326 INFO L78 Accepts]: Start accepts. Automaton has 13860 states and 14929 transitions. Word has length 687 [2025-03-03 10:34:43,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:43,326 INFO L471 AbstractCegarLoop]: Abstraction has 13860 states and 14929 transitions. [2025-03-03 10:34:43,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 13860 states and 14929 transitions. [2025-03-03 10:34:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-03-03 10:34:43,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:43,335 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:43,341 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-03 10:34:43,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:43,535 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:43,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:43,536 INFO L85 PathProgramCache]: Analyzing trace with hash 981106354, now seen corresponding path program 1 times [2025-03-03 10:34:43,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:43,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362722069] [2025-03-03 10:34:43,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:43,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:43,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-03 10:34:43,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-03 10:34:43,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:43,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1607 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-03 10:34:44,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:44,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362722069] [2025-03-03 10:34:44,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362722069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:44,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:44,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805718728] [2025-03-03 10:34:44,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:44,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:44,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:44,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:44,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:44,049 INFO L87 Difference]: Start difference. First operand 13860 states and 14929 transitions. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:44,543 INFO L93 Difference]: Finished difference Result 29019 states and 31264 transitions. [2025-03-03 10:34:44,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:44,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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 694 [2025-03-03 10:34:44,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:44,556 INFO L225 Difference]: With dead ends: 29019 [2025-03-03 10:34:44,556 INFO L226 Difference]: Without dead ends: 15529 [2025-03-03 10:34:44,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:44,564 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 134 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:44,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 107 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:34:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2025-03-03 10:34:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 13860. [2025-03-03 10:34:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13860 states, 13859 states have (on average 1.077206147629699) internal successors, (14929), 13859 states have internal predecessors, (14929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13860 states to 13860 states and 14929 transitions. [2025-03-03 10:34:44,672 INFO L78 Accepts]: Start accepts. Automaton has 13860 states and 14929 transitions. Word has length 694 [2025-03-03 10:34:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:44,672 INFO L471 AbstractCegarLoop]: Abstraction has 13860 states and 14929 transitions. [2025-03-03 10:34:44,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 13860 states and 14929 transitions. [2025-03-03 10:34:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-03 10:34:44,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:44,680 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:44,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 10:34:44,680 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:44,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1392593297, now seen corresponding path program 1 times [2025-03-03 10:34:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:44,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907087819] [2025-03-03 10:34:44,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:44,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:44,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-03 10:34:44,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-03 10:34:44,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:44,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1767 backedges. 1355 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-03 10:34:45,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:45,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907087819] [2025-03-03 10:34:45,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907087819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:45,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:45,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:34:45,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38129348] [2025-03-03 10:34:45,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:45,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:45,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:45,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:45,450 INFO L87 Difference]: Start difference. First operand 13860 states and 14929 transitions. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:46,182 INFO L93 Difference]: Finished difference Result 30868 states and 33239 transitions. [2025-03-03 10:34:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:46,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 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 730 [2025-03-03 10:34:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:46,194 INFO L225 Difference]: With dead ends: 30868 [2025-03-03 10:34:46,195 INFO L226 Difference]: Without dead ends: 17194 [2025-03-03 10:34:46,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:46,198 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 184 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:46,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 156 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:34:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17194 states. [2025-03-03 10:34:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17194 to 15707. [2025-03-03 10:34:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15707 states, 15706 states have (on average 1.072520056029543) internal successors, (16845), 15706 states have internal predecessors, (16845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15707 states to 15707 states and 16845 transitions. [2025-03-03 10:34:46,318 INFO L78 Accepts]: Start accepts. Automaton has 15707 states and 16845 transitions. Word has length 730 [2025-03-03 10:34:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:46,319 INFO L471 AbstractCegarLoop]: Abstraction has 15707 states and 16845 transitions. [2025-03-03 10:34:46,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 15707 states and 16845 transitions. [2025-03-03 10:34:46,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2025-03-03 10:34:46,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:46,328 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:46,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 10:34:46,328 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:46,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:46,328 INFO L85 PathProgramCache]: Analyzing trace with hash -434018524, now seen corresponding path program 1 times [2025-03-03 10:34:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:46,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646741911] [2025-03-03 10:34:46,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:46,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-03-03 10:34:46,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-03-03 10:34:46,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:46,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 1292 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-03-03 10:34:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646741911] [2025-03-03 10:34:46,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646741911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:46,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:46,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879445177] [2025-03-03 10:34:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:46,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:46,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:46,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:46,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:46,681 INFO L87 Difference]: Start difference. First operand 15707 states and 16845 transitions. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:47,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:47,125 INFO L93 Difference]: Finished difference Result 30488 states and 32698 transitions. [2025-03-03 10:34:47,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:47,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 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 750 [2025-03-03 10:34:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:47,141 INFO L225 Difference]: With dead ends: 30488 [2025-03-03 10:34:47,141 INFO L226 Difference]: Without dead ends: 15151 [2025-03-03 10:34:47,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:47,151 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 70 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:47,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 272 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:34:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15151 states. [2025-03-03 10:34:47,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15151 to 13123. [2025-03-03 10:34:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13123 states, 13122 states have (on average 1.067139155616522) internal successors, (14003), 13122 states have internal predecessors, (14003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13123 states to 13123 states and 14003 transitions. [2025-03-03 10:34:47,260 INFO L78 Accepts]: Start accepts. Automaton has 13123 states and 14003 transitions. Word has length 750 [2025-03-03 10:34:47,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:47,261 INFO L471 AbstractCegarLoop]: Abstraction has 13123 states and 14003 transitions. [2025-03-03 10:34:47,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 13123 states and 14003 transitions. [2025-03-03 10:34:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2025-03-03 10:34:47,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:47,294 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 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] [2025-03-03 10:34:47,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 10:34:47,294 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:47,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:47,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2077853165, now seen corresponding path program 1 times [2025-03-03 10:34:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:47,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455494288] [2025-03-03 10:34:47,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:47,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 811 statements into 1 equivalence classes. [2025-03-03 10:34:47,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 811 of 811 statements. [2025-03-03 10:34:47,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:47,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 1298 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-03-03 10:34:47,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:47,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455494288] [2025-03-03 10:34:47,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455494288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:47,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:47,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:47,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135385338] [2025-03-03 10:34:47,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:47,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:47,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:47,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:47,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:47,733 INFO L87 Difference]: Start difference. First operand 13123 states and 14003 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:48,173 INFO L93 Difference]: Finished difference Result 26428 states and 28220 transitions. [2025-03-03 10:34:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:48,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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 811 [2025-03-03 10:34:48,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:48,187 INFO L225 Difference]: With dead ends: 26428 [2025-03-03 10:34:48,187 INFO L226 Difference]: Without dead ends: 13859 [2025-03-03 10:34:48,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:48,194 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 108 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:48,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 352 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:34:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13859 states. [2025-03-03 10:34:48,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13859 to 13491. [2025-03-03 10:34:48,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13491 states, 13490 states have (on average 1.0661230541141586) internal successors, (14382), 13490 states have internal predecessors, (14382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13491 states to 13491 states and 14382 transitions. [2025-03-03 10:34:48,303 INFO L78 Accepts]: Start accepts. Automaton has 13491 states and 14382 transitions. Word has length 811 [2025-03-03 10:34:48,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:48,303 INFO L471 AbstractCegarLoop]: Abstraction has 13491 states and 14382 transitions. [2025-03-03 10:34:48,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 13491 states and 14382 transitions. [2025-03-03 10:34:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2025-03-03 10:34:48,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:48,312 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:48,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 10:34:48,312 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:48,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1373430135, now seen corresponding path program 1 times [2025-03-03 10:34:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:48,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540307753] [2025-03-03 10:34:48,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:48,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes. [2025-03-03 10:34:48,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements. [2025-03-03 10:34:48,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:48,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 1585 proven. 0 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2025-03-03 10:34:48,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:48,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540307753] [2025-03-03 10:34:48,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540307753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:48,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:48,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:48,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047294034] [2025-03-03 10:34:48,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:48,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:48,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:48,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:48,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:48,583 INFO L87 Difference]: Start difference. First operand 13491 states and 14382 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:49,003 INFO L93 Difference]: Finished difference Result 27351 states and 29176 transitions. [2025-03-03 10:34:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:49,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 840 [2025-03-03 10:34:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:49,014 INFO L225 Difference]: With dead ends: 27351 [2025-03-03 10:34:49,014 INFO L226 Difference]: Without dead ends: 14230 [2025-03-03 10:34:49,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:49,020 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 115 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:49,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 330 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:34:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14230 states. [2025-03-03 10:34:49,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14230 to 13307. [2025-03-03 10:34:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13307 states, 13306 states have (on average 1.0642567262888922) internal successors, (14161), 13306 states have internal predecessors, (14161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13307 states to 13307 states and 14161 transitions. [2025-03-03 10:34:49,125 INFO L78 Accepts]: Start accepts. Automaton has 13307 states and 14161 transitions. Word has length 840 [2025-03-03 10:34:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:49,125 INFO L471 AbstractCegarLoop]: Abstraction has 13307 states and 14161 transitions. [2025-03-03 10:34:49,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 13307 states and 14161 transitions. [2025-03-03 10:34:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2025-03-03 10:34:49,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:49,134 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:49,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 10:34:49,134 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:49,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:49,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1555850733, now seen corresponding path program 1 times [2025-03-03 10:34:49,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:49,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223668711] [2025-03-03 10:34:49,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:49,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 865 statements into 1 equivalence classes. [2025-03-03 10:34:49,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 865 of 865 statements. [2025-03-03 10:34:49,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:49,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2529 backedges. 2006 proven. 0 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2025-03-03 10:34:49,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:49,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223668711] [2025-03-03 10:34:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223668711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:49,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:34:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007849746] [2025-03-03 10:34:49,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:49,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:49,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:49,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:49,760 INFO L87 Difference]: Start difference. First operand 13307 states and 14161 transitions. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:50,552 INFO L93 Difference]: Finished difference Result 29568 states and 31537 transitions. [2025-03-03 10:34:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:50,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 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 865 [2025-03-03 10:34:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:50,567 INFO L225 Difference]: With dead ends: 29568 [2025-03-03 10:34:50,567 INFO L226 Difference]: Without dead ends: 16815 [2025-03-03 10:34:50,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:50,574 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 191 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:50,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 86 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:34:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16815 states. [2025-03-03 10:34:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16815 to 15523. [2025-03-03 10:34:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15523 states, 15522 states have (on average 1.0671305244169567) internal successors, (16564), 15522 states have internal predecessors, (16564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15523 states to 15523 states and 16564 transitions. [2025-03-03 10:34:50,713 INFO L78 Accepts]: Start accepts. Automaton has 15523 states and 16564 transitions. Word has length 865 [2025-03-03 10:34:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:50,714 INFO L471 AbstractCegarLoop]: Abstraction has 15523 states and 16564 transitions. [2025-03-03 10:34:50,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 15523 states and 16564 transitions. [2025-03-03 10:34:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2025-03-03 10:34:50,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:50,723 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:50,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 10:34:50,723 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:50,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash 609312306, now seen corresponding path program 1 times [2025-03-03 10:34:50,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:50,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62058740] [2025-03-03 10:34:50,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:50,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:50,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 872 statements into 1 equivalence classes. [2025-03-03 10:34:50,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 872 of 872 statements. [2025-03-03 10:34:50,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:50,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 1524 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-03 10:34:51,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:51,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62058740] [2025-03-03 10:34:51,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62058740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:51,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:51,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:34:51,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089641051] [2025-03-03 10:34:51,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:51,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:51,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:51,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:51,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:51,472 INFO L87 Difference]: Start difference. First operand 15523 states and 16564 transitions. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:52,139 INFO L93 Difference]: Finished difference Result 25499 states and 27132 transitions. [2025-03-03 10:34:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:52,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 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 872 [2025-03-03 10:34:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:52,141 INFO L225 Difference]: With dead ends: 25499 [2025-03-03 10:34:52,141 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:34:52,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:52,150 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 230 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:52,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 43 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:34:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:34:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:34:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:34:52,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 872 [2025-03-03 10:34:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:52,151 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:34:52,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:34:52,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:34:52,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:34:52,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 10:34:52,157 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:52,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:35:00,232 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 724 DAG size of output: 983 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 10:35:03,367 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:35:03,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:35:03 BoogieIcfgContainer [2025-03-03 10:35:03,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:35:03,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:35:03,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:35:03,386 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:35:03,387 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:34:07" (3/4) ... [2025-03-03 10:35:03,388 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:35:03,409 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:35:03,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:35:03,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:35:03,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:35:03,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:35:03,535 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:35:03,535 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:35:03,536 INFO L158 Benchmark]: Toolchain (without parser) took 58698.09ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 120.6MB in the beginning and 609.4MB in the end (delta: -488.8MB). Peak memory consumption was 600.7MB. Max. memory is 16.1GB. [2025-03-03 10:35:03,536 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:35:03,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.40ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 78.3MB in the end (delta: 42.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 10:35:03,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.30ms. Allocated memory is still 167.8MB. Free memory was 78.3MB in the beginning and 61.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:35:03,537 INFO L158 Benchmark]: Boogie Preprocessor took 146.10ms. Allocated memory is still 167.8MB. Free memory was 61.6MB in the beginning and 37.5MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:35:03,538 INFO L158 Benchmark]: IcfgBuilder took 1473.43ms. Allocated memory is still 167.8MB. Free memory was 37.5MB in the beginning and 99.3MB in the end (delta: -61.8MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2025-03-03 10:35:03,538 INFO L158 Benchmark]: TraceAbstraction took 56288.73ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 99.0MB in the beginning and 621.9MB in the end (delta: -522.9MB). Peak memory consumption was 811.7MB. Max. memory is 16.1GB. [2025-03-03 10:35:03,538 INFO L158 Benchmark]: Witness Printer took 149.13ms. Allocated memory is still 1.3GB. Free memory was 621.9MB in the beginning and 609.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:35:03,539 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.25ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 523.40ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 78.3MB in the end (delta: 42.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.30ms. Allocated memory is still 167.8MB. Free memory was 78.3MB in the beginning and 61.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.10ms. Allocated memory is still 167.8MB. Free memory was 61.6MB in the beginning and 37.5MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1473.43ms. Allocated memory is still 167.8MB. Free memory was 37.5MB in the beginning and 99.3MB in the end (delta: -61.8MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * TraceAbstraction took 56288.73ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 99.0MB in the beginning and 621.9MB in the end (delta: -522.9MB). Peak memory consumption was 811.7MB. Max. memory is 16.1GB. * Witness Printer took 149.13ms. Allocated memory is still 1.3GB. Free memory was 621.9MB in the beginning and 609.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 139]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.0s, OverallIterations: 31, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6310 SdHoareTripleChecker+Valid, 20.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6310 mSDsluCounter, 6092 SdHoareTripleChecker+Invalid, 16.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1003 mSDsCounter, 3535 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25027 IncrementalHoareTripleChecker+Invalid, 28562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3535 mSolverCounterUnsat, 5089 mSDtfsCounter, 25027 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2662 GetRequests, 2586 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23072occurred in iteration=21, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 52104 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 16756 NumberOfCodeBlocks, 16756 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 17393 ConstructedInterpolants, 0 QuantifiedInterpolants, 52363 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2407 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 35 InterpolantComputations, 30 PerfectInterpolantSequences, 31781/32129 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: 1044]: Location Invariant Derived location invariant: (((((((((((((((((((((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (246 <= a29)) || ((((a29 <= 275) && (141 <= a29)) && (a4 == 1)) && (a25 <= 9))) || ((((((long long) a23 + 55) <= 0) && (a4 == 0)) && (((long long) 28470 + a29) <= 0)) && (a25 <= 9))) || (((a23 <= 138) && (a4 == 1)) && (130 <= a29))) || ((((((a25 == 13) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a29 + 28553))) && (0 <= ((long long) a23 + 42))) && (a29 <= 130))) || (((((a23 <= 600000) && (307 <= a23)) && (a4 == 1)) && (246 <= a29)) && ((a25 != 12) || (a29 < 278)))) || (((((((long long) a23 + 55) <= 0) && (a4 == 0)) && ((140 < a29) || (a25 != 9))) && (a29 <= 220)) && (0 <= ((long long) a29 + 28553)))) || (((((((long long) a23 + 55) <= 0) && (a29 <= 275)) && (a25 == 12)) && (a4 == 0)) && (0 <= ((long long) a29 + 28553)))) || ((((((long long) a23 + 55) <= 0) && (a25 == 12)) && (a4 == 0)) && (((long long) a29 + 580291) <= 0))) || (((a23 <= 600000) && (a4 == 1)) && (a25 == 10))) || ((((a29 <= 275) && (141 <= a29)) && (a4 == 1)) && (a25 == 10))) || ((((a25 == 13) && (a23 <= 600000)) && (307 <= a23)) && (a4 == 1))) || (((a4 == 1) && (a25 <= 9)) && (a29 <= 130))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 275)) && (a4 == 0)) && (246 <= a29))) || ((((a25 == 13) && (a29 <= 240)) && (141 <= a29)) && (a4 == 1))) || ((((a25 == 12) && ((a23 < 307) || (a29 < 278))) && (a4 == 1)) && (a23 <= 312))) || (((a4 == 1) && (a23 <= 312)) && (a25 <= 9))) || ((((260 <= a29) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a25 <= 9))) || ((((a23 <= 600000) && (141 <= a29)) && (a29 <= 220)) && (a4 == 1))) || ((a23 <= 600000) && ((((a25 == 13) && (141 <= a29)) && (a4 == 1)) || (((a29 <= 275) && (a4 == 1)) && (246 <= a29))))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:35:03,555 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