./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label54.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 edb6f856db72a43ad08c83ff0e1ee56d288f58300ccdf5a7b1b400a926b63cbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:34:04,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:34:04,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:34:04,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:34:04,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:34:04,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:34:04,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:34:04,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:34:04,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:34:04,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:34:04,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:34:04,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:34:04,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:34:04,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:34:04,509 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:34:04,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:34:04,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:34:04,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:34:04,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:34:04,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:34:04,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:34:04,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:34:04,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:34:04,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:34:04,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:34:04,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:34:04,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:34:04,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:34:04,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:34:04,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:34:04,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:34:04,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:34:04,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:34:04,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:34:04,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:34:04,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:34:04,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:34:04,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:34:04,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:34:04,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:34:04,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:34:04,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:34:04,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:34:04,511 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-jdk21/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 -> edb6f856db72a43ad08c83ff0e1ee56d288f58300ccdf5a7b1b400a926b63cbe [2025-02-05 11:34:04,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:34:04,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:34:04,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:34:04,698 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:34:04,698 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:34:04,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label54.c [2025-02-05 11:34:05,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/201f0b192/c69d4837a17740e2bee6f74ff31d2ab2/FLAG628ad3e91 [2025-02-05 11:34:06,268 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:34:06,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label54.c [2025-02-05 11:34:06,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/201f0b192/c69d4837a17740e2bee6f74ff31d2ab2/FLAG628ad3e91 [2025-02-05 11:34:06,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/201f0b192/c69d4837a17740e2bee6f74ff31d2ab2 [2025-02-05 11:34:06,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:34:06,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:34:06,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:34:06,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:34:06,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:34:06,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:34:06" (1/1) ... [2025-02-05 11:34:06,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe56402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:06, skipping insertion in model container [2025-02-05 11:34:06,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:34:06" (1/1) ... [2025-02-05 11:34:06,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:34:06,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label54.c[5423,5436] [2025-02-05 11:34:06,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:34:06,963 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:34:06,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label54.c[5423,5436] [2025-02-05 11:34:07,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:34:07,142 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:34:07,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07 WrapperNode [2025-02-05 11:34:07,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:34:07,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:34:07,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:34:07,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:34:07,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,331 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-02-05 11:34:07,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:34:07,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:34:07,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:34:07,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:34:07,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,392 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-02-05 11:34:07,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:34:07,456 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:34:07,457 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:34:07,457 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:34:07,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (1/1) ... [2025-02-05 11:34:07,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:34:07,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:07,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:34:07,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:34:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:34:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:34:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:34:07,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:34:07,596 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:34:07,597 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:34:08,781 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-05 11:34:08,782 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:34:08,802 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:34:08,802 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:34:08,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:08 BoogieIcfgContainer [2025-02-05 11:34:08,803 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:34:08,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:34:08,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:34:08,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:34:08,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:34:06" (1/3) ... [2025-02-05 11:34:08,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193b701e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:34:08, skipping insertion in model container [2025-02-05 11:34:08,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:07" (2/3) ... [2025-02-05 11:34:08,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193b701e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:34:08, skipping insertion in model container [2025-02-05 11:34:08,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:08" (3/3) ... [2025-02-05 11:34:08,811 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label54.c [2025-02-05 11:34:08,824 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:34:08,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label54.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:34:08,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:34:08,874 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;@60dcb56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:34:08,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:34:08,877 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-02-05 11:34:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 11:34:08,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:08,881 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] [2025-02-05 11:34:08,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:08,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1059208889, now seen corresponding path program 1 times [2025-02-05 11:34:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:08,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725118051] [2025-02-05 11:34:08,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:08,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:08,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 11:34:08,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 11:34:08,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:08,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:09,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:09,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725118051] [2025-02-05 11:34:09,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725118051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:09,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:09,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:34:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357747336] [2025-02-05 11:34:09,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:09,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:09,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:09,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:09,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:09,119 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 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:09,927 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-02-05 11:34:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:09,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-02-05 11:34:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:09,936 INFO L225 Difference]: With dead ends: 761 [2025-02-05 11:34:09,936 INFO L226 Difference]: Without dead ends: 413 [2025-02-05 11:34:09,939 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-02-05 11:34:09,940 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 191 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:09,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:34:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-05 11:34:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-02-05 11:34:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-02-05 11:34:09,985 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 37 [2025-02-05 11:34:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:09,985 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-02-05 11:34:09,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-02-05 11:34:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 11:34:09,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:09,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:34:09,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:34:09,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:09,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash 859663089, now seen corresponding path program 1 times [2025-02-05 11:34:09,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:09,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175091529] [2025-02-05 11:34:09,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:09,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:10,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 11:34:10,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 11:34:10,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:10,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:10,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:10,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175091529] [2025-02-05 11:34:10,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175091529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:10,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:10,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:34:10,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108234134] [2025-02-05 11:34:10,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:10,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:10,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:10,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:10,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:10,204 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:10,825 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-02-05 11:34:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:10,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-02-05 11:34:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:10,835 INFO L225 Difference]: With dead ends: 1211 [2025-02-05 11:34:10,835 INFO L226 Difference]: Without dead ends: 800 [2025-02-05 11:34:10,839 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-02-05 11:34:10,840 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:10,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-05 11:34:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-02-05 11:34:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2025-02-05 11:34:10,915 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 105 [2025-02-05 11:34:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:10,916 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2025-02-05 11:34:10,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2025-02-05 11:34:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 11:34:10,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:10,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:34:10,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:34:10,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:10,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash -154731365, now seen corresponding path program 1 times [2025-02-05 11:34:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:10,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006785048] [2025-02-05 11:34:10,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:10,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 11:34:10,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 11:34:10,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:10,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:11,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:11,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006785048] [2025-02-05 11:34:11,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006785048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:11,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:11,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:11,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643321588] [2025-02-05 11:34:11,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:11,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:11,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:11,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:11,293 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:12,436 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2025-02-05 11:34:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:12,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-02-05 11:34:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:12,444 INFO L225 Difference]: With dead ends: 2505 [2025-02-05 11:34:12,444 INFO L226 Difference]: Without dead ends: 1718 [2025-02-05 11:34:12,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:34:12,448 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:12,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 218 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:34:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-02-05 11:34:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2025-02-05 11:34:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 1.2265032107413893) internal successors, (2101), 1713 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2025-02-05 11:34:12,488 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 106 [2025-02-05 11:34:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:12,488 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2025-02-05 11:34:12,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2025-02-05 11:34:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 11:34:12,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:12,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:34:12,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:34:12,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:12,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash 836329125, now seen corresponding path program 1 times [2025-02-05 11:34:12,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:12,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622902160] [2025-02-05 11:34:12,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:12,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 11:34:12,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 11:34:12,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:12,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:12,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:12,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622902160] [2025-02-05 11:34:12,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622902160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:12,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:12,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517183962] [2025-02-05 11:34:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:12,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:12,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:12,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:12,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:12,825 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:14,182 INFO L93 Difference]: Finished difference Result 5296 states and 6687 transitions. [2025-02-05 11:34:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:14,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-05 11:34:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:14,194 INFO L225 Difference]: With dead ends: 5296 [2025-02-05 11:34:14,195 INFO L226 Difference]: Without dead ends: 3768 [2025-02-05 11:34:14,196 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-02-05 11:34:14,198 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 357 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:14,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 87 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:34:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2025-02-05 11:34:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3767. [2025-02-05 11:34:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3767 states, 3766 states have (on average 1.2291556027615507) internal successors, (4629), 3766 states have internal predecessors, (4629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 4629 transitions. [2025-02-05 11:34:14,259 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 4629 transitions. Word has length 164 [2025-02-05 11:34:14,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:14,260 INFO L471 AbstractCegarLoop]: Abstraction has 3767 states and 4629 transitions. [2025-02-05 11:34:14,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 4629 transitions. [2025-02-05 11:34:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 11:34:14,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:14,265 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:14,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:34:14,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:14,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:14,266 INFO L85 PathProgramCache]: Analyzing trace with hash 701269587, now seen corresponding path program 1 times [2025-02-05 11:34:14,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:14,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787368025] [2025-02-05 11:34:14,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:14,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 11:34:14,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 11:34:14,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:14,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:14,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787368025] [2025-02-05 11:34:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787368025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:14,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591075407] [2025-02-05 11:34:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:14,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:14,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:14,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:14,466 INFO L87 Difference]: Start difference. First operand 3767 states and 4629 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:15,267 INFO L93 Difference]: Finished difference Result 8652 states and 10854 transitions. [2025-02-05 11:34:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:15,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-02-05 11:34:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:15,284 INFO L225 Difference]: With dead ends: 8652 [2025-02-05 11:34:15,284 INFO L226 Difference]: Without dead ends: 5256 [2025-02-05 11:34:15,287 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-02-05 11:34:15,289 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:15,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 346 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2025-02-05 11:34:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5241. [2025-02-05 11:34:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5241 states, 5240 states have (on average 1.208206106870229) internal successors, (6331), 5240 states have internal predecessors, (6331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 6331 transitions. [2025-02-05 11:34:15,373 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 6331 transitions. Word has length 217 [2025-02-05 11:34:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:15,373 INFO L471 AbstractCegarLoop]: Abstraction has 5241 states and 6331 transitions. [2025-02-05 11:34:15,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 6331 transitions. [2025-02-05 11:34:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 11:34:15,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:15,376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:15,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:34:15,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:15,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash -769962631, now seen corresponding path program 1 times [2025-02-05 11:34:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447413409] [2025-02-05 11:34:15,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:15,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:15,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 11:34:15,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 11:34:15,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:15,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 11:34:15,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:15,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447413409] [2025-02-05 11:34:15,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447413409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:15,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:15,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:15,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174835517] [2025-02-05 11:34:15,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:15,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:15,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:15,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:15,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:15,582 INFO L87 Difference]: Start difference. First operand 5241 states and 6331 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:16,455 INFO L93 Difference]: Finished difference Result 11042 states and 13505 transitions. [2025-02-05 11:34:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:16,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 218 [2025-02-05 11:34:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:16,477 INFO L225 Difference]: With dead ends: 11042 [2025-02-05 11:34:16,477 INFO L226 Difference]: Without dead ends: 6730 [2025-02-05 11:34:16,483 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-02-05 11:34:16,484 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 184 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:16,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 335 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:34:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6730 states. [2025-02-05 11:34:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6730 to 6730. [2025-02-05 11:34:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6730 states, 6729 states have (on average 1.2059741417744092) internal successors, (8115), 6729 states have internal predecessors, (8115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 8115 transitions. [2025-02-05 11:34:16,609 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 8115 transitions. Word has length 218 [2025-02-05 11:34:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:16,609 INFO L471 AbstractCegarLoop]: Abstraction has 6730 states and 8115 transitions. [2025-02-05 11:34:16,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 8115 transitions. [2025-02-05 11:34:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 11:34:16,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:16,615 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 11:34:16,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:34:16,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:16,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:16,616 INFO L85 PathProgramCache]: Analyzing trace with hash 922565688, now seen corresponding path program 1 times [2025-02-05 11:34:16,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:16,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231003993] [2025-02-05 11:34:16,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:16,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 11:34:16,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 11:34:16,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:16,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 11:34:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231003993] [2025-02-05 11:34:16,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231003993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:16,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:16,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647650545] [2025-02-05 11:34:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:16,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:16,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:16,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:16,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:16,771 INFO L87 Difference]: Start difference. First operand 6730 states and 8115 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:17,700 INFO L93 Difference]: Finished difference Result 14574 states and 17862 transitions. [2025-02-05 11:34:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:17,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 219 [2025-02-05 11:34:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:17,724 INFO L225 Difference]: With dead ends: 14574 [2025-02-05 11:34:17,724 INFO L226 Difference]: Without dead ends: 8215 [2025-02-05 11:34:17,733 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-02-05 11:34:17,734 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 160 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:17,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 387 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:34:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8215 states. [2025-02-05 11:34:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8215 to 8018. [2025-02-05 11:34:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8018 states, 8017 states have (on average 1.1990769614569041) internal successors, (9613), 8017 states have internal predecessors, (9613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8018 states to 8018 states and 9613 transitions. [2025-02-05 11:34:17,838 INFO L78 Accepts]: Start accepts. Automaton has 8018 states and 9613 transitions. Word has length 219 [2025-02-05 11:34:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:17,839 INFO L471 AbstractCegarLoop]: Abstraction has 8018 states and 9613 transitions. [2025-02-05 11:34:17,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8018 states and 9613 transitions. [2025-02-05 11:34:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-02-05 11:34:17,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:17,842 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:17,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:34:17,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:17,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:17,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1549872342, now seen corresponding path program 1 times [2025-02-05 11:34:17,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:17,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803341709] [2025-02-05 11:34:17,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:17,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:17,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-02-05 11:34:17,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-02-05 11:34:17,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:17,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-02-05 11:34:17,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:17,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803341709] [2025-02-05 11:34:17,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803341709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:17,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:17,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861147548] [2025-02-05 11:34:17,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:17,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:17,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:17,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:17,998 INFO L87 Difference]: Start difference. First operand 8018 states and 9613 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:18,973 INFO L93 Difference]: Finished difference Result 16238 states and 19619 transitions. [2025-02-05 11:34:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:18,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 239 [2025-02-05 11:34:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:18,998 INFO L225 Difference]: With dead ends: 16238 [2025-02-05 11:34:18,999 INFO L226 Difference]: Without dead ends: 9333 [2025-02-05 11:34:19,005 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-02-05 11:34:19,006 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 165 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:19,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 208 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:34:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9333 states. [2025-02-05 11:34:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9333 to 9122. [2025-02-05 11:34:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9122 states, 9121 states have (on average 1.199978072579761) internal successors, (10945), 9121 states have internal predecessors, (10945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9122 states to 9122 states and 10945 transitions. [2025-02-05 11:34:19,116 INFO L78 Accepts]: Start accepts. Automaton has 9122 states and 10945 transitions. Word has length 239 [2025-02-05 11:34:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:19,118 INFO L471 AbstractCegarLoop]: Abstraction has 9122 states and 10945 transitions. [2025-02-05 11:34:19,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 9122 states and 10945 transitions. [2025-02-05 11:34:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-02-05 11:34:19,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:19,124 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 11:34:19,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:34:19,124 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:19,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2081040065, now seen corresponding path program 1 times [2025-02-05 11:34:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:19,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477081994] [2025-02-05 11:34:19,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:19,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-05 11:34:19,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-05 11:34:19,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:19,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 11:34:19,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:19,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477081994] [2025-02-05 11:34:19,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477081994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:19,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:19,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138198072] [2025-02-05 11:34:19,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:19,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:19,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:19,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:19,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:19,295 INFO L87 Difference]: Start difference. First operand 9122 states and 10945 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:20,125 INFO L93 Difference]: Finished difference Result 18068 states and 21719 transitions. [2025-02-05 11:34:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:20,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 246 [2025-02-05 11:34:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:20,138 INFO L225 Difference]: With dead ends: 18068 [2025-02-05 11:34:20,139 INFO L226 Difference]: Without dead ends: 9132 [2025-02-05 11:34:20,146 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-02-05 11:34:20,150 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 164 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:20,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 378 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:34:20,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9132 states. [2025-02-05 11:34:20,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9132 to 8937. [2025-02-05 11:34:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8937 states, 8936 states have (on average 1.1687555953446733) internal successors, (10444), 8936 states have internal predecessors, (10444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 10444 transitions. [2025-02-05 11:34:20,237 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 10444 transitions. Word has length 246 [2025-02-05 11:34:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:20,237 INFO L471 AbstractCegarLoop]: Abstraction has 8937 states and 10444 transitions. [2025-02-05 11:34:20,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 10444 transitions. [2025-02-05 11:34:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-05 11:34:20,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:20,241 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:20,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:34:20,241 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:20,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:20,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1304244775, now seen corresponding path program 1 times [2025-02-05 11:34:20,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:20,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68462792] [2025-02-05 11:34:20,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:20,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:20,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-05 11:34:20,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-05 11:34:20,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:20,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 11:34:20,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:20,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68462792] [2025-02-05 11:34:20,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68462792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:20,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:20,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:20,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582897349] [2025-02-05 11:34:20,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:20,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:20,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:20,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:20,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:20,486 INFO L87 Difference]: Start difference. First operand 8937 states and 10444 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:21,362 INFO L93 Difference]: Finished difference Result 17503 states and 20681 transitions. [2025-02-05 11:34:21,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:21,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 269 [2025-02-05 11:34:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:21,377 INFO L225 Difference]: With dead ends: 17503 [2025-02-05 11:34:21,378 INFO L226 Difference]: Without dead ends: 9863 [2025-02-05 11:34:21,385 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-02-05 11:34:21,386 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 187 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:21,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 156 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:34:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9863 states. [2025-02-05 11:34:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9863 to 8937. [2025-02-05 11:34:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8937 states, 8936 states have (on average 1.1687555953446733) internal successors, (10444), 8936 states have internal predecessors, (10444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 10444 transitions. [2025-02-05 11:34:21,469 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 10444 transitions. Word has length 269 [2025-02-05 11:34:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:21,469 INFO L471 AbstractCegarLoop]: Abstraction has 8937 states and 10444 transitions. [2025-02-05 11:34:21,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:21,470 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 10444 transitions. [2025-02-05 11:34:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-05 11:34:21,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:21,474 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:21,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:34:21,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:21,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:21,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1786682554, now seen corresponding path program 1 times [2025-02-05 11:34:21,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:21,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3007486] [2025-02-05 11:34:21,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:21,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 11:34:21,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 11:34:21,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:21,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-05 11:34:21,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3007486] [2025-02-05 11:34:21,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3007486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:21,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:21,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439692883] [2025-02-05 11:34:21,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:21,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:21,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:21,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:21,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:21,673 INFO L87 Difference]: Start difference. First operand 8937 states and 10444 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-02-05 11:34:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:22,570 INFO L93 Difference]: Finished difference Result 22473 states and 26592 transitions. [2025-02-05 11:34:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:22,570 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 272 [2025-02-05 11:34:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:22,593 INFO L225 Difference]: With dead ends: 22473 [2025-02-05 11:34:22,594 INFO L226 Difference]: Without dead ends: 13907 [2025-02-05 11:34:22,603 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-02-05 11:34:22,605 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 183 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:22,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 109 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:34:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13907 states. [2025-02-05 11:34:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13907 to 13901. [2025-02-05 11:34:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13901 states, 13900 states have (on average 1.1744604316546763) internal successors, (16325), 13900 states have internal predecessors, (16325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13901 states to 13901 states and 16325 transitions. [2025-02-05 11:34:22,729 INFO L78 Accepts]: Start accepts. Automaton has 13901 states and 16325 transitions. Word has length 272 [2025-02-05 11:34:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:22,730 INFO L471 AbstractCegarLoop]: Abstraction has 13901 states and 16325 transitions. [2025-02-05 11:34:22,730 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-02-05 11:34:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 13901 states and 16325 transitions. [2025-02-05 11:34:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-02-05 11:34:22,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:22,737 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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-02-05 11:34:22,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:34:22,737 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:22,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:22,738 INFO L85 PathProgramCache]: Analyzing trace with hash -620454719, now seen corresponding path program 1 times [2025-02-05 11:34:22,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:22,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695754908] [2025-02-05 11:34:22,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:22,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-05 11:34:22,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-05 11:34:22,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:22,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-02-05 11:34:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695754908] [2025-02-05 11:34:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695754908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:22,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:22,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:22,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470129873] [2025-02-05 11:34:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:22,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:22,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:22,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:22,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:22,937 INFO L87 Difference]: Start difference. First operand 13901 states and 16325 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:23,589 INFO L93 Difference]: Finished difference Result 28896 states and 34458 transitions. [2025-02-05 11:34:23,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:23,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 310 [2025-02-05 11:34:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:23,613 INFO L225 Difference]: With dead ends: 28896 [2025-02-05 11:34:23,613 INFO L226 Difference]: Without dead ends: 17212 [2025-02-05 11:34:23,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:23,623 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 187 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:23,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 152 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17212 states. [2025-02-05 11:34:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17212 to 13152. [2025-02-05 11:34:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13152 states, 13151 states have (on average 1.1702532126834462) internal successors, (15390), 13151 states have internal predecessors, (15390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13152 states to 13152 states and 15390 transitions. [2025-02-05 11:34:23,744 INFO L78 Accepts]: Start accepts. Automaton has 13152 states and 15390 transitions. Word has length 310 [2025-02-05 11:34:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:23,746 INFO L471 AbstractCegarLoop]: Abstraction has 13152 states and 15390 transitions. [2025-02-05 11:34:23,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 13152 states and 15390 transitions. [2025-02-05 11:34:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-02-05 11:34:23,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:23,760 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:23,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:34:23,761 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:23,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash -87495162, now seen corresponding path program 1 times [2025-02-05 11:34:23,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:23,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260671115] [2025-02-05 11:34:23,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:23,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:23,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-02-05 11:34:23,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-02-05 11:34:23,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:23,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 11:34:24,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:24,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260671115] [2025-02-05 11:34:24,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260671115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:24,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:24,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:34:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956025587] [2025-02-05 11:34:24,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:24,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:24,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:24,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:24,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:24,087 INFO L87 Difference]: Start difference. First operand 13152 states and 15390 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:25,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:25,314 INFO L93 Difference]: Finished difference Result 38667 states and 45241 transitions. [2025-02-05 11:34:25,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:25,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 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-02-05 11:34:25,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:25,354 INFO L225 Difference]: With dead ends: 38667 [2025-02-05 11:34:25,355 INFO L226 Difference]: Without dead ends: 25702 [2025-02-05 11:34:25,366 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-02-05 11:34:25,367 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 303 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:25,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 90 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:34:25,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2025-02-05 11:34:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 21828. [2025-02-05 11:34:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21828 states, 21827 states have (on average 1.1637879690291841) internal successors, (25402), 21827 states have internal predecessors, (25402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21828 states to 21828 states and 25402 transitions. [2025-02-05 11:34:25,633 INFO L78 Accepts]: Start accepts. Automaton has 21828 states and 25402 transitions. Word has length 394 [2025-02-05 11:34:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:25,634 INFO L471 AbstractCegarLoop]: Abstraction has 21828 states and 25402 transitions. [2025-02-05 11:34:25,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 21828 states and 25402 transitions. [2025-02-05 11:34:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-05 11:34:25,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:25,649 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:34:25,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:34:25,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:25,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:25,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1630235125, now seen corresponding path program 1 times [2025-02-05 11:34:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:25,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124578923] [2025-02-05 11:34:25,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:25,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:25,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-05 11:34:25,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-05 11:34:25,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:25,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-02-05 11:34:25,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:25,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124578923] [2025-02-05 11:34:25,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124578923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:25,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:25,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:34:25,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984616630] [2025-02-05 11:34:25,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:25,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:25,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:25,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:25,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:25,823 INFO L87 Difference]: Start difference. First operand 21828 states and 25402 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:26,520 INFO L93 Difference]: Finished difference Result 46593 states and 54341 transitions. [2025-02-05 11:34:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:26,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 406 [2025-02-05 11:34:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:26,556 INFO L225 Difference]: With dead ends: 46593 [2025-02-05 11:34:26,556 INFO L226 Difference]: Without dead ends: 23109 [2025-02-05 11:34:26,571 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-02-05 11:34:26,572 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 78 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:26,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 149 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23109 states. [2025-02-05 11:34:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23109 to 18505. [2025-02-05 11:34:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18505 states, 18504 states have (on average 1.1263510592304367) internal successors, (20842), 18504 states have internal predecessors, (20842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18505 states to 18505 states and 20842 transitions. [2025-02-05 11:34:26,772 INFO L78 Accepts]: Start accepts. Automaton has 18505 states and 20842 transitions. Word has length 406 [2025-02-05 11:34:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:26,773 INFO L471 AbstractCegarLoop]: Abstraction has 18505 states and 20842 transitions. [2025-02-05 11:34:26,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 18505 states and 20842 transitions. [2025-02-05 11:34:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-02-05 11:34:26,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:26,787 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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-02-05 11:34:26,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:34:26,787 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:26,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:26,787 INFO L85 PathProgramCache]: Analyzing trace with hash -557670494, now seen corresponding path program 1 times [2025-02-05 11:34:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:26,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145845367] [2025-02-05 11:34:26,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:26,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:26,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-02-05 11:34:26,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-02-05 11:34:26,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:26,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-02-05 11:34:27,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:27,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145845367] [2025-02-05 11:34:27,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145845367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:27,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:27,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:27,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322108255] [2025-02-05 11:34:27,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:27,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:27,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:27,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:27,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:27,032 INFO L87 Difference]: Start difference. First operand 18505 states and 20842 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:27,672 INFO L93 Difference]: Finished difference Result 35346 states and 39835 transitions. [2025-02-05 11:34:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:27,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 514 [2025-02-05 11:34:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:27,691 INFO L225 Difference]: With dead ends: 35346 [2025-02-05 11:34:27,691 INFO L226 Difference]: Without dead ends: 16657 [2025-02-05 11:34:27,704 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-02-05 11:34:27,706 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 68 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:27,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 310 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:27,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2025-02-05 11:34:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 13699. [2025-02-05 11:34:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13699 states, 13698 states have (on average 1.1188494670754854) internal successors, (15326), 13698 states have internal predecessors, (15326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13699 states to 13699 states and 15326 transitions. [2025-02-05 11:34:27,838 INFO L78 Accepts]: Start accepts. Automaton has 13699 states and 15326 transitions. Word has length 514 [2025-02-05 11:34:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:27,838 INFO L471 AbstractCegarLoop]: Abstraction has 13699 states and 15326 transitions. [2025-02-05 11:34:27,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 13699 states and 15326 transitions. [2025-02-05 11:34:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-02-05 11:34:27,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:27,850 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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-02-05 11:34:27,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:34:27,850 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:27,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:27,851 INFO L85 PathProgramCache]: Analyzing trace with hash 822886815, now seen corresponding path program 1 times [2025-02-05 11:34:27,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:27,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860849159] [2025-02-05 11:34:27,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:27,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:27,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-02-05 11:34:27,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-02-05 11:34:27,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:27,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-02-05 11:34:28,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:28,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860849159] [2025-02-05 11:34:28,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860849159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:28,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:28,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:34:28,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708749728] [2025-02-05 11:34:28,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:28,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:28,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:28,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:28,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:28,239 INFO L87 Difference]: Start difference. First operand 13699 states and 15326 transitions. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:29,278 INFO L93 Difference]: Finished difference Result 32752 states and 36708 transitions. [2025-02-05 11:34:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:29,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 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 535 [2025-02-05 11:34:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:29,298 INFO L225 Difference]: With dead ends: 32752 [2025-02-05 11:34:29,299 INFO L226 Difference]: Without dead ends: 18871 [2025-02-05 11:34:29,309 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-02-05 11:34:29,310 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 296 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:29,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 80 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:34:29,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18871 states. [2025-02-05 11:34:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18871 to 13514. [2025-02-05 11:34:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13514 states, 13513 states have (on average 1.1201805668615408) internal successors, (15137), 13513 states have internal predecessors, (15137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13514 states to 13514 states and 15137 transitions. [2025-02-05 11:34:29,560 INFO L78 Accepts]: Start accepts. Automaton has 13514 states and 15137 transitions. Word has length 535 [2025-02-05 11:34:29,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:29,561 INFO L471 AbstractCegarLoop]: Abstraction has 13514 states and 15137 transitions. [2025-02-05 11:34:29,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 13514 states and 15137 transitions. [2025-02-05 11:34:29,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-02-05 11:34:29,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:29,577 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 11:34:29,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:34:29,577 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:29,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:29,578 INFO L85 PathProgramCache]: Analyzing trace with hash -232272481, now seen corresponding path program 1 times [2025-02-05 11:34:29,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:29,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388733286] [2025-02-05 11:34:29,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:29,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:29,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-02-05 11:34:29,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-02-05 11:34:29,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:29,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:30,270 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 11:34:30,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:30,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388733286] [2025-02-05 11:34:30,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388733286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:30,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:30,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:34:30,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856709818] [2025-02-05 11:34:30,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:30,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:30,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:30,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:30,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:30,272 INFO L87 Difference]: Start difference. First operand 13514 states and 15137 transitions. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:31,370 INFO L93 Difference]: Finished difference Result 32197 states and 36051 transitions. [2025-02-05 11:34:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:31,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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 561 [2025-02-05 11:34:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:31,390 INFO L225 Difference]: With dead ends: 32197 [2025-02-05 11:34:31,390 INFO L226 Difference]: Without dead ends: 18869 [2025-02-05 11:34:31,400 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-02-05 11:34:31,400 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 183 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:31,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 93 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:34:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18869 states. [2025-02-05 11:34:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18869 to 15178. [2025-02-05 11:34:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15178 states, 15177 states have (on average 1.1156355010871715) internal successors, (16932), 15177 states have internal predecessors, (16932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15178 states to 15178 states and 16932 transitions. [2025-02-05 11:34:31,537 INFO L78 Accepts]: Start accepts. Automaton has 15178 states and 16932 transitions. Word has length 561 [2025-02-05 11:34:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:31,537 INFO L471 AbstractCegarLoop]: Abstraction has 15178 states and 16932 transitions. [2025-02-05 11:34:31,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 15178 states and 16932 transitions. [2025-02-05 11:34:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-02-05 11:34:31,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:31,547 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-02-05 11:34:31,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:34:31,547 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:31,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:31,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1642576662, now seen corresponding path program 1 times [2025-02-05 11:34:31,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:31,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068507951] [2025-02-05 11:34:31,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:31,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:31,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-02-05 11:34:31,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-02-05 11:34:31,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:31,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-02-05 11:34:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068507951] [2025-02-05 11:34:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068507951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:31,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:31,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:31,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216417525] [2025-02-05 11:34:31,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:31,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:31,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:31,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:31,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:31,800 INFO L87 Difference]: Start difference. First operand 15178 states and 16932 transitions. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:32,422 INFO L93 Difference]: Finished difference Result 29984 states and 33482 transitions. [2025-02-05 11:34:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:32,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 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 577 [2025-02-05 11:34:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:32,439 INFO L225 Difference]: With dead ends: 29984 [2025-02-05 11:34:32,439 INFO L226 Difference]: Without dead ends: 14992 [2025-02-05 11:34:32,449 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-02-05 11:34:32,449 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 146 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:32,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 295 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14992 states. [2025-02-05 11:34:32,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14992 to 14072. [2025-02-05 11:34:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14072 states, 14071 states have (on average 1.1120744794257693) internal successors, (15648), 14071 states have internal predecessors, (15648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 15648 transitions. [2025-02-05 11:34:32,682 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 15648 transitions. Word has length 577 [2025-02-05 11:34:32,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:32,682 INFO L471 AbstractCegarLoop]: Abstraction has 14072 states and 15648 transitions. [2025-02-05 11:34:32,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 15648 transitions. [2025-02-05 11:34:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-02-05 11:34:32,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:32,692 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:32,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:34:32,693 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:32,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash 33670350, now seen corresponding path program 1 times [2025-02-05 11:34:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:32,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332397929] [2025-02-05 11:34:32,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:32,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:32,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-02-05 11:34:32,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-02-05 11:34:32,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:32,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-02-05 11:34:32,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:32,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332397929] [2025-02-05 11:34:32,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332397929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:32,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:32,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:34:32,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638915715] [2025-02-05 11:34:32,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:32,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:32,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:32,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:32,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:32,972 INFO L87 Difference]: Start difference. First operand 14072 states and 15648 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:33,309 INFO L93 Difference]: Finished difference Result 27581 states and 30685 transitions. [2025-02-05 11:34:33,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:33,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 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 602 [2025-02-05 11:34:33,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:33,323 INFO L225 Difference]: With dead ends: 27581 [2025-02-05 11:34:33,323 INFO L226 Difference]: Without dead ends: 13695 [2025-02-05 11:34:33,332 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-02-05 11:34:33,332 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:33,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 37 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:34:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13695 states. [2025-02-05 11:34:33,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13695 to 13691. [2025-02-05 11:34:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13691 states, 13690 states have (on average 1.1113951789627465) internal successors, (15215), 13690 states have internal predecessors, (15215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13691 states to 13691 states and 15215 transitions. [2025-02-05 11:34:33,455 INFO L78 Accepts]: Start accepts. Automaton has 13691 states and 15215 transitions. Word has length 602 [2025-02-05 11:34:33,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:33,455 INFO L471 AbstractCegarLoop]: Abstraction has 13691 states and 15215 transitions. [2025-02-05 11:34:33,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 13691 states and 15215 transitions. [2025-02-05 11:34:33,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-02-05 11:34:33,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:33,467 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:34:33,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:34:33,467 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:33,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1056540603, now seen corresponding path program 1 times [2025-02-05 11:34:33,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:33,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796038516] [2025-02-05 11:34:33,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:33,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:33,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-02-05 11:34:33,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-02-05 11:34:33,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:33,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 621 proven. 154 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-02-05 11:34:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:33,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796038516] [2025-02-05 11:34:33,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796038516] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:33,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674834640] [2025-02-05 11:34:33,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:33,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:33,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:33,982 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:34:33,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:34:34,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-02-05 11:34:34,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-02-05 11:34:34,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:34,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:34,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 11:34:34,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 621 proven. 154 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-02-05 11:34:35,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:34:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 621 proven. 154 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-02-05 11:34:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674834640] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:34:36,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:34:36,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-02-05 11:34:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117804043] [2025-02-05 11:34:36,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:34:36,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:34:36,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:36,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:34:36,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:34:36,962 INFO L87 Difference]: Start difference. First operand 13691 states and 15215 transitions. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:38,225 INFO L93 Difference]: Finished difference Result 29151 states and 32379 transitions. [2025-02-05 11:34:38,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 11:34:38,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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 626 [2025-02-05 11:34:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:38,240 INFO L225 Difference]: With dead ends: 29151 [2025-02-05 11:34:38,241 INFO L226 Difference]: Without dead ends: 15094 [2025-02-05 11:34:38,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1256 GetRequests, 1251 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:34:38,251 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 448 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:38,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 59 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:34:38,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15094 states. [2025-02-05 11:34:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15094 to 13129. [2025-02-05 11:34:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13129 states, 13128 states have (on average 1.0943022547227301) internal successors, (14366), 13128 states have internal predecessors, (14366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13129 states to 13129 states and 14366 transitions. [2025-02-05 11:34:38,427 INFO L78 Accepts]: Start accepts. Automaton has 13129 states and 14366 transitions. Word has length 626 [2025-02-05 11:34:38,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:38,428 INFO L471 AbstractCegarLoop]: Abstraction has 13129 states and 14366 transitions. [2025-02-05 11:34:38,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 13129 states and 14366 transitions. [2025-02-05 11:34:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-02-05 11:34:38,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:38,442 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1] [2025-02-05 11:34:38,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:34:38,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:38,644 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:38,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:38,646 INFO L85 PathProgramCache]: Analyzing trace with hash 485783770, now seen corresponding path program 1 times [2025-02-05 11:34:38,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:38,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054217414] [2025-02-05 11:34:38,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:38,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:38,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-02-05 11:34:38,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-02-05 11:34:38,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:38,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 876 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-02-05 11:34:38,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:38,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054217414] [2025-02-05 11:34:38,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054217414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:38,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:38,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:38,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533661960] [2025-02-05 11:34:38,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:38,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:38,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:38,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:38,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:38,883 INFO L87 Difference]: Start difference. First operand 13129 states and 14366 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:39,486 INFO L93 Difference]: Finished difference Result 27726 states and 30336 transitions. [2025-02-05 11:34:39,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:39,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 645 [2025-02-05 11:34:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:39,501 INFO L225 Difference]: With dead ends: 27726 [2025-02-05 11:34:39,501 INFO L226 Difference]: Without dead ends: 15521 [2025-02-05 11:34:39,509 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-02-05 11:34:39,511 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 117 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:39,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 113 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15521 states. [2025-02-05 11:34:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15521 to 14599. [2025-02-05 11:34:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14599 states, 14598 states have (on average 1.0876832442800384) internal successors, (15878), 14598 states have internal predecessors, (15878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14599 states to 14599 states and 15878 transitions. [2025-02-05 11:34:39,632 INFO L78 Accepts]: Start accepts. Automaton has 14599 states and 15878 transitions. Word has length 645 [2025-02-05 11:34:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:39,632 INFO L471 AbstractCegarLoop]: Abstraction has 14599 states and 15878 transitions. [2025-02-05 11:34:39,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 14599 states and 15878 transitions. [2025-02-05 11:34:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-02-05 11:34:39,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:39,641 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1] [2025-02-05 11:34:39,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 11:34:39,642 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash 238637701, now seen corresponding path program 1 times [2025-02-05 11:34:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041229216] [2025-02-05 11:34:39,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:39,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-02-05 11:34:39,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-02-05 11:34:39,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:39,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 1049 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-02-05 11:34:39,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:39,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041229216] [2025-02-05 11:34:39,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041229216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:39,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:39,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:39,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36472249] [2025-02-05 11:34:39,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:39,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:39,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:39,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:39,971 INFO L87 Difference]: Start difference. First operand 14599 states and 15878 transitions. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:40,819 INFO L93 Difference]: Finished difference Result 31045 states and 33788 transitions. [2025-02-05 11:34:40,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:40,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 680 [2025-02-05 11:34:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:40,836 INFO L225 Difference]: With dead ends: 31045 [2025-02-05 11:34:40,836 INFO L226 Difference]: Without dead ends: 17554 [2025-02-05 11:34:40,846 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-02-05 11:34:40,854 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 171 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:40,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 64 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:34:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17554 states. [2025-02-05 11:34:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17554 to 14599. [2025-02-05 11:34:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14599 states, 14598 states have (on average 1.0876832442800384) internal successors, (15878), 14598 states have internal predecessors, (15878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14599 states to 14599 states and 15878 transitions. [2025-02-05 11:34:40,984 INFO L78 Accepts]: Start accepts. Automaton has 14599 states and 15878 transitions. Word has length 680 [2025-02-05 11:34:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:40,984 INFO L471 AbstractCegarLoop]: Abstraction has 14599 states and 15878 transitions. [2025-02-05 11:34:40,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 14599 states and 15878 transitions. [2025-02-05 11:34:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-02-05 11:34:40,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:40,994 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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-02-05 11:34:40,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 11:34:40,994 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:40,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:40,995 INFO L85 PathProgramCache]: Analyzing trace with hash 809674115, now seen corresponding path program 1 times [2025-02-05 11:34:40,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:40,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925843072] [2025-02-05 11:34:40,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:41,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-02-05 11:34:41,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-02-05 11:34:41,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:41,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-02-05 11:34:41,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:41,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925843072] [2025-02-05 11:34:41,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925843072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:41,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:41,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010620890] [2025-02-05 11:34:41,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:41,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:41,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:41,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:41,193 INFO L87 Difference]: Start difference. First operand 14599 states and 15878 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:41,676 INFO L93 Difference]: Finished difference Result 28642 states and 31168 transitions. [2025-02-05 11:34:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:41,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 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-02-05 11:34:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:41,690 INFO L225 Difference]: With dead ends: 28642 [2025-02-05 11:34:41,690 INFO L226 Difference]: Without dead ends: 14967 [2025-02-05 11:34:41,699 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-02-05 11:34:41,700 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 100 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:41,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 131 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:34:41,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14967 states. [2025-02-05 11:34:41,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14967 to 14228. [2025-02-05 11:34:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14228 states, 14227 states have (on average 1.0837140648063541) internal successors, (15418), 14227 states have internal predecessors, (15418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14228 states to 14228 states and 15418 transitions. [2025-02-05 11:34:41,820 INFO L78 Accepts]: Start accepts. Automaton has 14228 states and 15418 transitions. Word has length 694 [2025-02-05 11:34:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:41,820 INFO L471 AbstractCegarLoop]: Abstraction has 14228 states and 15418 transitions. [2025-02-05 11:34:41,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 14228 states and 15418 transitions. [2025-02-05 11:34:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-02-05 11:34:41,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:41,830 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-02-05 11:34:41,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 11:34:41,830 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:41,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:41,831 INFO L85 PathProgramCache]: Analyzing trace with hash -763826978, now seen corresponding path program 1 times [2025-02-05 11:34:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110261428] [2025-02-05 11:34:41,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:41,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-02-05 11:34:41,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-02-05 11:34:41,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:41,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 954 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-02-05 11:34:42,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:42,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110261428] [2025-02-05 11:34:42,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110261428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:42,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:42,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:42,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383173930] [2025-02-05 11:34:42,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:42,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:42,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:42,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:42,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:42,308 INFO L87 Difference]: Start difference. First operand 14228 states and 15418 transitions. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:43,315 INFO L93 Difference]: Finished difference Result 30856 states and 33483 transitions. [2025-02-05 11:34:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:43,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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 725 [2025-02-05 11:34:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:43,349 INFO L225 Difference]: With dead ends: 30856 [2025-02-05 11:34:43,349 INFO L226 Difference]: Without dead ends: 16997 [2025-02-05 11:34:43,359 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-02-05 11:34:43,360 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 118 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:43,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 92 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:34:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16997 states. [2025-02-05 11:34:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16997 to 15706. [2025-02-05 11:34:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15706 states, 15705 states have (on average 1.0811206622094873) internal successors, (16979), 15705 states have internal predecessors, (16979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15706 states to 15706 states and 16979 transitions. [2025-02-05 11:34:43,509 INFO L78 Accepts]: Start accepts. Automaton has 15706 states and 16979 transitions. Word has length 725 [2025-02-05 11:34:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:43,510 INFO L471 AbstractCegarLoop]: Abstraction has 15706 states and 16979 transitions. [2025-02-05 11:34:43,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 15706 states and 16979 transitions. [2025-02-05 11:34:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-02-05 11:34:43,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:43,522 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:43,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 11:34:43,522 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:43,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash -218829641, now seen corresponding path program 1 times [2025-02-05 11:34:43,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:43,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640290940] [2025-02-05 11:34:43,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:43,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:43,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-02-05 11:34:43,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-02-05 11:34:43,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:43,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1495 backedges. 903 proven. 0 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-02-05 11:34:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640290940] [2025-02-05 11:34:43,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640290940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:43,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:43,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152875106] [2025-02-05 11:34:43,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:43,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:43,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:43,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:43,857 INFO L87 Difference]: Start difference. First operand 15706 states and 16979 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:44,395 INFO L93 Difference]: Finished difference Result 31042 states and 33601 transitions. [2025-02-05 11:34:44,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:44,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 756 [2025-02-05 11:34:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:44,410 INFO L225 Difference]: With dead ends: 31042 [2025-02-05 11:34:44,410 INFO L226 Difference]: Without dead ends: 16074 [2025-02-05 11:34:44,420 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-02-05 11:34:44,420 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 195 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:44,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 329 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16074 states. [2025-02-05 11:34:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16074 to 13122. [2025-02-05 11:34:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13122 states, 13121 states have (on average 1.075603993598049) internal successors, (14113), 13121 states have internal predecessors, (14113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13122 states to 13122 states and 14113 transitions. [2025-02-05 11:34:44,534 INFO L78 Accepts]: Start accepts. Automaton has 13122 states and 14113 transitions. Word has length 756 [2025-02-05 11:34:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:44,534 INFO L471 AbstractCegarLoop]: Abstraction has 13122 states and 14113 transitions. [2025-02-05 11:34:44,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 13122 states and 14113 transitions. [2025-02-05 11:34:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2025-02-05 11:34:44,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:44,543 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 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] [2025-02-05 11:34:44,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 11:34:44,544 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:44,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2144105324, now seen corresponding path program 1 times [2025-02-05 11:34:44,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:44,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528537307] [2025-02-05 11:34:44,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:44,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 763 statements into 1 equivalence classes. [2025-02-05 11:34:44,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 763 of 763 statements. [2025-02-05 11:34:44,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:44,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 648 proven. 554 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-02-05 11:34:45,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:45,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528537307] [2025-02-05 11:34:45,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528537307] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:45,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336704547] [2025-02-05 11:34:45,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:45,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:45,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:45,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:34:45,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:34:45,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 763 statements into 1 equivalence classes. [2025-02-05 11:34:45,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 763 of 763 statements. [2025-02-05 11:34:45,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:45,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:45,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:34:45,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-02-05 11:34:45,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:34:45,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336704547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:45,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:34:45,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:34:45,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108646390] [2025-02-05 11:34:45,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:45,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:45,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:45,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:45,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:34:45,804 INFO L87 Difference]: Start difference. First operand 13122 states and 14113 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:46,317 INFO L93 Difference]: Finished difference Result 26251 states and 28258 transitions. [2025-02-05 11:34:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:46,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 763 [2025-02-05 11:34:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:46,330 INFO L225 Difference]: With dead ends: 26251 [2025-02-05 11:34:46,330 INFO L226 Difference]: Without dead ends: 13685 [2025-02-05 11:34:46,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:34:46,339 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 103 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:46,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 317 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:34:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13685 states. [2025-02-05 11:34:46,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13685 to 13492. [2025-02-05 11:34:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13492 states, 13491 states have (on average 1.0747906011415018) internal successors, (14500), 13491 states have internal predecessors, (14500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 14500 transitions. [2025-02-05 11:34:46,446 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 14500 transitions. Word has length 763 [2025-02-05 11:34:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:46,448 INFO L471 AbstractCegarLoop]: Abstraction has 13492 states and 14500 transitions. [2025-02-05 11:34:46,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 14500 transitions. [2025-02-05 11:34:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-02-05 11:34:46,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:46,458 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:34:46,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:34:46,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 11:34:46,661 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:46,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:46,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1415782606, now seen corresponding path program 1 times [2025-02-05 11:34:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:46,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537948654] [2025-02-05 11:34:46,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:46,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:46,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-02-05 11:34:46,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-02-05 11:34:46,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:46,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1317 proven. 0 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2025-02-05 11:34:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537948654] [2025-02-05 11:34:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537948654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:47,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:47,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:34:47,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867043013] [2025-02-05 11:34:47,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:47,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:47,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:47,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:47,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:47,553 INFO L87 Difference]: Start difference. First operand 13492 states and 14500 transitions. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:48,390 INFO L93 Difference]: Finished difference Result 26242 states and 28170 transitions. [2025-02-05 11:34:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:48,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 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 817 [2025-02-05 11:34:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:48,401 INFO L225 Difference]: With dead ends: 26242 [2025-02-05 11:34:48,401 INFO L226 Difference]: Without dead ends: 13306 [2025-02-05 11:34:48,409 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-02-05 11:34:48,410 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 177 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:48,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 50 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:34:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13306 states. [2025-02-05 11:34:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13306 to 11458. [2025-02-05 11:34:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11458 states, 11457 states have (on average 1.0700881557126647) internal successors, (12260), 11457 states have internal predecessors, (12260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11458 states to 11458 states and 12260 transitions. [2025-02-05 11:34:48,506 INFO L78 Accepts]: Start accepts. Automaton has 11458 states and 12260 transitions. Word has length 817 [2025-02-05 11:34:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:48,507 INFO L471 AbstractCegarLoop]: Abstraction has 11458 states and 12260 transitions. [2025-02-05 11:34:48,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 11458 states and 12260 transitions. [2025-02-05 11:34:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2025-02-05 11:34:48,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:48,515 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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, 1, 1] [2025-02-05 11:34:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 11:34:48,519 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:48,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1247221406, now seen corresponding path program 1 times [2025-02-05 11:34:48,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:48,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191200186] [2025-02-05 11:34:48,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:48,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 863 statements into 1 equivalence classes. [2025-02-05 11:34:48,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 863 of 863 statements. [2025-02-05 11:34:48,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:48,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 1346 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2025-02-05 11:34:48,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:48,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191200186] [2025-02-05 11:34:48,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191200186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:48,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:48,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:48,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520279813] [2025-02-05 11:34:48,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:48,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:48,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:48,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:48,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:48,820 INFO L87 Difference]: Start difference. First operand 11458 states and 12260 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:49,411 INFO L93 Difference]: Finished difference Result 22724 states and 24337 transitions. [2025-02-05 11:34:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:49,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 863 [2025-02-05 11:34:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:49,424 INFO L225 Difference]: With dead ends: 22724 [2025-02-05 11:34:49,424 INFO L226 Difference]: Without dead ends: 11822 [2025-02-05 11:34:49,432 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-02-05 11:34:49,433 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 189 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:49,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 297 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2025-02-05 11:34:49,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 11822. [2025-02-05 11:34:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11822 states, 11821 states have (on average 1.0663226461382285) internal successors, (12605), 11821 states have internal predecessors, (12605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11822 states to 11822 states and 12605 transitions. [2025-02-05 11:34:49,533 INFO L78 Accepts]: Start accepts. Automaton has 11822 states and 12605 transitions. Word has length 863 [2025-02-05 11:34:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:49,533 INFO L471 AbstractCegarLoop]: Abstraction has 11822 states and 12605 transitions. [2025-02-05 11:34:49,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:34:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 11822 states and 12605 transitions. [2025-02-05 11:34:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2025-02-05 11:34:49,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:49,545 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 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-02-05 11:34:49,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 11:34:49,545 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:49,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:49,547 INFO L85 PathProgramCache]: Analyzing trace with hash 448305862, now seen corresponding path program 1 times [2025-02-05 11:34:49,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:49,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923269555] [2025-02-05 11:34:49,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:49,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:49,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 868 statements into 1 equivalence classes. [2025-02-05 11:34:49,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 868 of 868 statements. [2025-02-05 11:34:49,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:49,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2012 backedges. 1338 proven. 125 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2025-02-05 11:34:50,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:50,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923269555] [2025-02-05 11:34:50,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923269555] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:50,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879018063] [2025-02-05 11:34:50,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:50,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:50,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:50,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:34:50,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:34:50,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 868 statements into 1 equivalence classes. [2025-02-05 11:34:50,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 868 of 868 statements. [2025-02-05 11:34:50,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:50,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:50,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 11:34:50,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2012 backedges. 1386 proven. 201 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-02-05 11:34:53,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:34:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2012 backedges. 1300 proven. 163 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2025-02-05 11:34:56,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879018063] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:34:56,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:34:56,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 12 [2025-02-05 11:34:56,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381820305] [2025-02-05 11:34:56,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:34:56,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 11:34:56,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:56,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 11:34:56,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 11:34:56,270 INFO L87 Difference]: Start difference. First operand 11822 states and 12605 transitions. Second operand has 13 states, 13 states have (on average 60.84615384615385) internal successors, (791), 12 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:00,646 INFO L93 Difference]: Finished difference Result 22762 states and 24283 transitions. [2025-02-05 11:35:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 11:35:00,647 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 60.84615384615385) internal successors, (791), 12 states have internal predecessors, (791), 0 states have call successors, (0), 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 868 [2025-02-05 11:35:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:00,648 INFO L225 Difference]: With dead ends: 22762 [2025-02-05 11:35:00,648 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:35:00,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1756 GetRequests, 1727 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2025-02-05 11:35:00,656 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2040 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6860 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 7383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 6860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:00,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2040 Valid, 147 Invalid, 7383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 6860 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 11:35:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:35:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:35:00,660 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-02-05 11:35:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:35:00,661 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 868 [2025-02-05 11:35:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:00,661 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:35:00,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 60.84615384615385) internal successors, (791), 12 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:35:00,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:35:00,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:35:00,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 11:35:00,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:35:00,872 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] [2025-02-05 11:35:00,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:35:07,160 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:35:07,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:35:07 BoogieIcfgContainer [2025-02-05 11:35:07,191 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:35:07,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:35:07,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:35:07,192 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:35:07,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:08" (3/4) ... [2025-02-05 11:35:07,196 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:35:07,213 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 11:35:07,214 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:35:07,214 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:35:07,215 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:35:07,330 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:35:07,330 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:35:07,330 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:35:07,331 INFO L158 Benchmark]: Toolchain (without parser) took 60863.02ms. Allocated memory was 167.8MB in the beginning and 947.9MB in the end (delta: 780.1MB). Free memory was 119.0MB in the beginning and 433.4MB in the end (delta: -314.3MB). Peak memory consumption was 463.9MB. Max. memory is 16.1GB. [2025-02-05 11:35:07,331 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:35:07,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 675.35ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 76.3MB in the end (delta: 41.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 11:35:07,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 186.41ms. Allocated memory is still 167.8MB. Free memory was 75.4MB in the beginning and 58.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 11:35:07,332 INFO L158 Benchmark]: Boogie Preprocessor took 123.62ms. Allocated memory is still 167.8MB. Free memory was 58.6MB in the beginning and 35.3MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:35:07,332 INFO L158 Benchmark]: IcfgBuilder took 1346.36ms. Allocated memory is still 167.8MB. Free memory was 35.3MB in the beginning and 97.6MB in the end (delta: -62.3MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2025-02-05 11:35:07,332 INFO L158 Benchmark]: TraceAbstraction took 58386.97ms. Allocated memory was 167.8MB in the beginning and 947.9MB in the end (delta: 780.1MB). Free memory was 97.6MB in the beginning and 450.1MB in the end (delta: -352.5MB). Peak memory consumption was 575.5MB. Max. memory is 16.1GB. [2025-02-05 11:35:07,333 INFO L158 Benchmark]: Witness Printer took 138.20ms. Allocated memory is still 947.9MB. Free memory was 450.1MB in the beginning and 433.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 11:35:07,333 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.52ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 675.35ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 76.3MB in the end (delta: 41.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 186.41ms. Allocated memory is still 167.8MB. Free memory was 75.4MB in the beginning and 58.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.62ms. Allocated memory is still 167.8MB. Free memory was 58.6MB in the beginning and 35.3MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1346.36ms. Allocated memory is still 167.8MB. Free memory was 35.3MB in the beginning and 97.6MB in the end (delta: -62.3MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 58386.97ms. Allocated memory was 167.8MB in the beginning and 947.9MB in the end (delta: 780.1MB). Free memory was 97.6MB in the beginning and 450.1MB in the end (delta: -352.5MB). Peak memory consumption was 575.5MB. Max. memory is 16.1GB. * Witness Printer took 138.20ms. Allocated memory is still 947.9MB. Free memory was 450.1MB in the beginning and 433.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 127]: 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: 52.0s, OverallIterations: 29, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 28.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7452 SdHoareTripleChecker+Valid, 25.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7452 mSDsluCounter, 5371 SdHoareTripleChecker+Invalid, 21.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 810 mSDsCounter, 3643 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26694 IncrementalHoareTripleChecker+Invalid, 30337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3643 mSolverCounterUnsat, 4561 mSDtfsCounter, 26694 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3857 GetRequests, 3784 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21828occurred in iteration=13, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 39899 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 15685 NumberOfCodeBlocks, 15685 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 17145 ConstructedInterpolants, 0 QuantifiedInterpolants, 50986 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2811 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 34 InterpolantComputations, 27 PerfectInterpolantSequences, 28185/29690 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: (((((((((((((((((((((((((((((((a25 == 12) && (a23 <= 306)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || (((((a23 < 307) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15))) || ((((a25 == 12) && (a4 == 1)) && (a23 <= 137)) && (a29 <= 130))) || ((((((a25 == 13) && (a29 <= 310110)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((a4 == 1) && (a25 == 10)) && (a23 <= 137))) || ((((a29 <= 276) && (a23 <= 138)) && (a4 == 1)) && (a25 == 10))) || (((((((a25 == 13) && (a4 == 0)) && (a3 == 1)) && (a8 == 15)) && (((long long) 59274 + a29) <= 0)) && (0 <= ((long long) a23 + 42))) && (a23 <= 137))) || (((((((a23 <= 600000) && (a29 <= 276)) && (141 <= a29)) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((a29 <= 276) && (a25 == 11)) && (a23 <= 138)) && (a4 == 1))) || (((((((a25 == 9) || (a25 == 10)) && (a29 <= 245)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a23 <= 600000)) && (307 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 12) && (a4 == 0)) && (a29 <= 599998)) && (a3 == 1)) && (a8 == 15)) && (a23 <= 137))) || (((((a25 == 9) && (a3 == 1)) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15))) || (((((((a4 == 0) && (a25 == 11)) && (278 <= a29)) && (a29 <= 599998)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15))) || ((((((a25 == 12) && (a29 <= 276)) && (a4 == 0)) && (141 <= a29)) && (a3 == 1)) && (a8 == 15))) || ((((((((a23 <= 600000) && (a29 <= 310110)) && (a4 == 1)) || ((a4 == 1) && (a23 <= 312))) && (a25 == 12)) && (141 <= a29)) && (a3 == 1)) && (a8 == 15))) || (((((((a4 == 0) && (278 <= a29)) && (a25 <= 10)) && (a29 <= 310110)) && (a3 == 1)) && (a8 == 15)) && (a23 <= 137))) || ((((((a23 <= 600000) && (a25 == 11)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 12) && (((long long) a29 + 320173) <= 0)) && (a4 == 0)) && (a3 == 1)) && (a8 == 15))) || (((((((a23 <= 600000) && (307 <= a23)) && (278 <= a29)) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a29 <= 140) && (a23 <= 306)) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((a25 <= 10) && (a29 <= 245)) && (141 <= a29)) && (a3 == 1)) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15))) || (((((((a25 == 12) && (a23 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && (((long long) 59274 + a29) <= 0))) || (((a25 == 11) && (a4 == 1)) && (a23 <= 137))) || (((((a23 <= 600000) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:35:07,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE