./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/Problem18_label40.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 1a53e4c70dff58f3400fe09c8b43892b5493d2ca012910f006ca78f70be38079 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:20:30,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:20:30,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:20:30,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:20:30,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:20:30,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:20:30,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:20:30,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:20:30,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:20:30,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:20:30,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:20:30,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:20:30,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:20:30,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:20:30,465 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:20:30,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:20:30,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:20:30,466 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:20:30,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:20:30,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:20:30,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:20:30,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:20:30,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:20:30,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:20:30,466 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:20:30,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:20:30,466 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:20:30,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:20:30,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:20:30,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:20:30,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:20:30,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:20:30,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:20:30,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:20:30,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:20:30,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:20:30,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:20:30,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:20:30,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:20:30,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:20:30,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:20:30,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:20:30,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:20:30,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:20:30,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:20:30,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:20:30,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:20:30,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:20:30,468 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 -> 1a53e4c70dff58f3400fe09c8b43892b5493d2ca012910f006ca78f70be38079 [2025-01-09 00:20:30,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:20:30,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:20:30,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:20:30,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:20:30,724 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:20:30,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label40.c [2025-01-09 00:20:31,878 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2eeb6b15/94cafd3b08014e409944b57b8fbb484b/FLAG5d820a7f1 [2025-01-09 00:20:32,351 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:20:32,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label40.c [2025-01-09 00:20:32,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2eeb6b15/94cafd3b08014e409944b57b8fbb484b/FLAG5d820a7f1 [2025-01-09 00:20:32,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2eeb6b15/94cafd3b08014e409944b57b8fbb484b [2025-01-09 00:20:32,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:20:32,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:20:32,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:20:32,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:20:32,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:20:32,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:20:32" (1/1) ... [2025-01-09 00:20:32,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40523784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:32, skipping insertion in model container [2025-01-09 00:20:32,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:20:32" (1/1) ... [2025-01-09 00:20:32,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:20:32,700 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/Problem18_label40.c[4742,4755] [2025-01-09 00:20:33,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:20:33,096 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:20:33,113 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/Problem18_label40.c[4742,4755] [2025-01-09 00:20:33,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:20:33,307 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:20:33,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33 WrapperNode [2025-01-09 00:20:33,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:20:33,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:20:33,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:20:33,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:20:33,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,501 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-01-09 00:20:33,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:20:33,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:20:33,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:20:33,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:20:33,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,615 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-01-09 00:20:33,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:20:33,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:20:33,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:20:33,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:20:33,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (1/1) ... [2025-01-09 00:20:33,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:20:33,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:20:33,784 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-01-09 00:20:33,814 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-01-09 00:20:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:20:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:20:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:20:33,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:20:33,873 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:20:33,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:20:36,869 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-01-09 00:20:36,870 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:20:36,907 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:20:36,907 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:20:36,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:20:36 BoogieIcfgContainer [2025-01-09 00:20:36,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:20:36,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:20:36,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:20:36,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:20:36,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:20:32" (1/3) ... [2025-01-09 00:20:36,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3151dc58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:20:36, skipping insertion in model container [2025-01-09 00:20:36,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:33" (2/3) ... [2025-01-09 00:20:36,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3151dc58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:20:36, skipping insertion in model container [2025-01-09 00:20:36,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:20:36" (3/3) ... [2025-01-09 00:20:36,921 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label40.c [2025-01-09 00:20:36,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:20:36,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label40.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:20:37,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:20:37,026 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;@3c33d02d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:20:37,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:20:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 00:20:37,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:37,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:20:37,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:37,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:37,045 INFO L85 PathProgramCache]: Analyzing trace with hash -730872606, now seen corresponding path program 1 times [2025-01-09 00:20:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529418508] [2025-01-09 00:20:37,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:37,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 00:20:37,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 00:20:37,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:37,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:20:37,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:37,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529418508] [2025-01-09 00:20:37,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529418508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:37,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:37,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:20:37,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315407861] [2025-01-09 00:20:37,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:37,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:37,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:37,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:37,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:37,386 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:39,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:39,959 INFO L93 Difference]: Finished difference Result 2205 states and 4263 transitions. [2025-01-09 00:20:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:39,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-01-09 00:20:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:39,979 INFO L225 Difference]: With dead ends: 2205 [2025-01-09 00:20:39,979 INFO L226 Difference]: Without dead ends: 1384 [2025-01-09 00:20:39,985 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-01-09 00:20:39,987 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 675 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:39,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 430 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 00:20:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-01-09 00:20:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-01-09 00:20:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.6514822848879247) internal successors, (2284), 1383 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2284 transitions. [2025-01-09 00:20:40,086 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2284 transitions. Word has length 44 [2025-01-09 00:20:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:40,087 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2284 transitions. [2025-01-09 00:20:40,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2284 transitions. [2025-01-09 00:20:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 00:20:40,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:40,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-01-09 00:20:40,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:20:40,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:40,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:40,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2002686965, now seen corresponding path program 1 times [2025-01-09 00:20:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:40,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544733544] [2025-01-09 00:20:40,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:40,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 00:20:40,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 00:20:40,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:40,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:20:40,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:40,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544733544] [2025-01-09 00:20:40,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544733544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:40,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:40,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:20:40,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787916146] [2025-01-09 00:20:40,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:40,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:40,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:40,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:40,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:40,314 INFO L87 Difference]: Start difference. First operand 1384 states and 2284 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:42,891 INFO L93 Difference]: Finished difference Result 4146 states and 6847 transitions. [2025-01-09 00:20:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:42,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-01-09 00:20:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:42,905 INFO L225 Difference]: With dead ends: 4146 [2025-01-09 00:20:42,906 INFO L226 Difference]: Without dead ends: 2764 [2025-01-09 00:20:42,909 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-01-09 00:20:42,910 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 712 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:42,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 531 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 00:20:42,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-01-09 00:20:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2025-01-09 00:20:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.404632645674991) internal successors, (3881), 2763 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3881 transitions. [2025-01-09 00:20:42,994 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3881 transitions. Word has length 110 [2025-01-09 00:20:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:42,995 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3881 transitions. [2025-01-09 00:20:42,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3881 transitions. [2025-01-09 00:20:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 00:20:42,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:42,999 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:20:43,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:20:43,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:43,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1713459800, now seen corresponding path program 1 times [2025-01-09 00:20:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:43,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404459021] [2025-01-09 00:20:43,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:43,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:43,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 00:20:43,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 00:20:43,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:43,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:20:43,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:43,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404459021] [2025-01-09 00:20:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404459021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:43,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:43,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:20:43,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068091912] [2025-01-09 00:20:43,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:43,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:43,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:43,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:43,142 INFO L87 Difference]: Start difference. First operand 2764 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:45,355 INFO L93 Difference]: Finished difference Result 8288 states and 11639 transitions. [2025-01-09 00:20:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-01-09 00:20:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:45,372 INFO L225 Difference]: With dead ends: 8288 [2025-01-09 00:20:45,372 INFO L226 Difference]: Without dead ends: 5526 [2025-01-09 00:20:45,376 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-01-09 00:20:45,376 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 709 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:45,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 434 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:20:45,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2025-01-09 00:20:45,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5524. [2025-01-09 00:20:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.2657975737823646) internal successors, (6991), 5523 states have internal predecessors, (6991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6991 transitions. [2025-01-09 00:20:45,492 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 6991 transitions. Word has length 111 [2025-01-09 00:20:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:45,492 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 6991 transitions. [2025-01-09 00:20:45,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 6991 transitions. [2025-01-09 00:20:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 00:20:45,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:45,495 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:20:45,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:20:45,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:45,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1097556089, now seen corresponding path program 1 times [2025-01-09 00:20:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440159400] [2025-01-09 00:20:45,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:45,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 00:20:45,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 00:20:45,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:45,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:20:45,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:45,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440159400] [2025-01-09 00:20:45,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440159400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:45,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:45,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:45,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087314352] [2025-01-09 00:20:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:45,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:20:45,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:45,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:20:45,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:20:45,807 INFO L87 Difference]: Start difference. First operand 5524 states and 6991 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:48,828 INFO L93 Difference]: Finished difference Result 13808 states and 17091 transitions. [2025-01-09 00:20:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:20:48,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-01-09 00:20:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:48,856 INFO L225 Difference]: With dead ends: 13808 [2025-01-09 00:20:48,856 INFO L226 Difference]: Without dead ends: 8286 [2025-01-09 00:20:48,861 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-01-09 00:20:48,862 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 1925 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4350 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 4467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:48,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 643 Invalid, 4467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4350 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 00:20:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8286 states. [2025-01-09 00:20:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 8284. [2025-01-09 00:20:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8284 states, 8283 states have (on average 1.202100688156465) internal successors, (9957), 8283 states have internal predecessors, (9957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 9957 transitions. [2025-01-09 00:20:49,029 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 9957 transitions. Word has length 137 [2025-01-09 00:20:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:49,030 INFO L471 AbstractCegarLoop]: Abstraction has 8284 states and 9957 transitions. [2025-01-09 00:20:49,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 9957 transitions. [2025-01-09 00:20:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 00:20:49,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:49,034 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:20:49,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:20:49,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:49,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1438601193, now seen corresponding path program 1 times [2025-01-09 00:20:49,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:49,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168989643] [2025-01-09 00:20:49,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:49,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 00:20:49,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 00:20:49,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:49,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:20:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:49,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168989643] [2025-01-09 00:20:49,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168989643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:49,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:49,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741292785] [2025-01-09 00:20:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:49,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:49,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:49,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:49,201 INFO L87 Difference]: Start difference. First operand 8284 states and 9957 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:51,271 INFO L93 Difference]: Finished difference Result 22086 states and 26900 transitions. [2025-01-09 00:20:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:51,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-01-09 00:20:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:51,304 INFO L225 Difference]: With dead ends: 22086 [2025-01-09 00:20:51,304 INFO L226 Difference]: Without dead ends: 13804 [2025-01-09 00:20:51,312 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-01-09 00:20:51,313 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 649 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 753 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:51,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1323 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:20:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13804 states. [2025-01-09 00:20:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13804 to 12424. [2025-01-09 00:20:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12424 states, 12423 states have (on average 1.1787007969089591) internal successors, (14643), 12423 states have internal predecessors, (14643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12424 states to 12424 states and 14643 transitions. [2025-01-09 00:20:51,583 INFO L78 Accepts]: Start accepts. Automaton has 12424 states and 14643 transitions. Word has length 226 [2025-01-09 00:20:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:51,583 INFO L471 AbstractCegarLoop]: Abstraction has 12424 states and 14643 transitions. [2025-01-09 00:20:51,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 12424 states and 14643 transitions. [2025-01-09 00:20:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-09 00:20:51,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:51,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:20:51,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:20:51,589 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:51,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1311233968, now seen corresponding path program 1 times [2025-01-09 00:20:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:51,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816974278] [2025-01-09 00:20:51,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:51,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:51,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 00:20:51,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 00:20:51,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:51,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:20:52,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:52,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816974278] [2025-01-09 00:20:52,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816974278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:52,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:52,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:52,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679571253] [2025-01-09 00:20:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:52,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:20:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:52,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:20:52,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:20:52,021 INFO L87 Difference]: Start difference. First operand 12424 states and 14643 transitions. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:54,016 INFO L93 Difference]: Finished difference Result 27661 states and 32159 transitions. [2025-01-09 00:20:54,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:20:54,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 344 [2025-01-09 00:20:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:54,042 INFO L225 Difference]: With dead ends: 27661 [2025-01-09 00:20:54,042 INFO L226 Difference]: Without dead ends: 15186 [2025-01-09 00:20:54,050 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-01-09 00:20:54,051 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 515 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3039 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:54,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 642 Invalid, 3241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3039 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:20:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15186 states. [2025-01-09 00:20:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 15184. [2025-01-09 00:20:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15184 states, 15183 states have (on average 1.1130211420667853) internal successors, (16899), 15183 states have internal predecessors, (16899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15184 states to 15184 states and 16899 transitions. [2025-01-09 00:20:54,216 INFO L78 Accepts]: Start accepts. Automaton has 15184 states and 16899 transitions. Word has length 344 [2025-01-09 00:20:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:54,216 INFO L471 AbstractCegarLoop]: Abstraction has 15184 states and 16899 transitions. [2025-01-09 00:20:54,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 15184 states and 16899 transitions. [2025-01-09 00:20:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-01-09 00:20:54,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:54,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:20:54,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:20:54,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:54,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash -683801337, now seen corresponding path program 1 times [2025-01-09 00:20:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:54,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253325585] [2025-01-09 00:20:54,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:54,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-01-09 00:20:54,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-01-09 00:20:54,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:54,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:20:54,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:54,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253325585] [2025-01-09 00:20:54,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253325585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:54,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:54,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:54,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631057878] [2025-01-09 00:20:54,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:54,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:54,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:54,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:54,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:54,632 INFO L87 Difference]: Start difference. First operand 15184 states and 16899 transitions. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:56,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:56,557 INFO L93 Difference]: Finished difference Result 37266 states and 41935 transitions. [2025-01-09 00:20:56,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:56,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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 410 [2025-01-09 00:20:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:56,592 INFO L225 Difference]: With dead ends: 37266 [2025-01-09 00:20:56,592 INFO L226 Difference]: Without dead ends: 22084 [2025-01-09 00:20:56,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:56,606 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 633 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:56,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 344 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:20:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22084 states. [2025-01-09 00:20:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22084 to 21394. [2025-01-09 00:20:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21394 states, 21393 states have (on average 1.126910671715047) internal successors, (24108), 21393 states have internal predecessors, (24108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21394 states to 21394 states and 24108 transitions. [2025-01-09 00:20:56,916 INFO L78 Accepts]: Start accepts. Automaton has 21394 states and 24108 transitions. Word has length 410 [2025-01-09 00:20:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:56,916 INFO L471 AbstractCegarLoop]: Abstraction has 21394 states and 24108 transitions. [2025-01-09 00:20:56,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 21394 states and 24108 transitions. [2025-01-09 00:20:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 00:20:56,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:56,926 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:20:56,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:20:56,926 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:56,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash -978224454, now seen corresponding path program 1 times [2025-01-09 00:20:56,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:56,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139793147] [2025-01-09 00:20:56,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:56,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 00:20:56,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 00:20:56,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:56,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 00:20:57,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:57,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139793147] [2025-01-09 00:20:57,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139793147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:57,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:20:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053824902] [2025-01-09 00:20:57,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:57,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:57,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:57,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:57,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:57,256 INFO L87 Difference]: Start difference. First operand 21394 states and 24108 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:59,071 INFO L93 Difference]: Finished difference Result 49686 states and 55870 transitions. [2025-01-09 00:20:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:59,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 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 428 [2025-01-09 00:20:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:59,117 INFO L225 Difference]: With dead ends: 49686 [2025-01-09 00:20:59,118 INFO L226 Difference]: Without dead ends: 28294 [2025-01-09 00:20:59,134 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-01-09 00:20:59,135 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 465 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:59,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 81 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:20:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28294 states. [2025-01-09 00:20:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28294 to 28294. [2025-01-09 00:20:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28294 states, 28293 states have (on average 1.1052557169617927) internal successors, (31271), 28293 states have internal predecessors, (31271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28294 states to 28294 states and 31271 transitions. [2025-01-09 00:20:59,557 INFO L78 Accepts]: Start accepts. Automaton has 28294 states and 31271 transitions. Word has length 428 [2025-01-09 00:20:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:59,559 INFO L471 AbstractCegarLoop]: Abstraction has 28294 states and 31271 transitions. [2025-01-09 00:20:59,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 28294 states and 31271 transitions. [2025-01-09 00:20:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-01-09 00:20:59,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:59,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:20:59,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:20:59,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:59,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:59,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1628777782, now seen corresponding path program 1 times [2025-01-09 00:20:59,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:59,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077375024] [2025-01-09 00:20:59,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:59,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-09 00:20:59,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-09 00:20:59,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:59,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:21:00,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:00,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077375024] [2025-01-09 00:21:00,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077375024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:00,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:00,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:00,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448139973] [2025-01-09 00:21:00,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:00,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:00,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:00,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:00,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:00,170 INFO L87 Difference]: Start difference. First operand 28294 states and 31271 transitions. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:01,839 INFO L93 Difference]: Finished difference Result 62796 states and 69558 transitions. [2025-01-09 00:21:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:01,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 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 461 [2025-01-09 00:21:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:01,876 INFO L225 Difference]: With dead ends: 62796 [2025-01-09 00:21:01,876 INFO L226 Difference]: Without dead ends: 34504 [2025-01-09 00:21:01,890 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-01-09 00:21:01,891 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 575 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:01,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 979 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:21:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34504 states. [2025-01-09 00:21:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34504 to 33124. [2025-01-09 00:21:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33124 states, 33123 states have (on average 1.0961869395888053) internal successors, (36309), 33123 states have internal predecessors, (36309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 36309 transitions. [2025-01-09 00:21:02,255 INFO L78 Accepts]: Start accepts. Automaton has 33124 states and 36309 transitions. Word has length 461 [2025-01-09 00:21:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:02,256 INFO L471 AbstractCegarLoop]: Abstraction has 33124 states and 36309 transitions. [2025-01-09 00:21:02,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 33124 states and 36309 transitions. [2025-01-09 00:21:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-01-09 00:21:02,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:02,263 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:21:02,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:21:02,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:02,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1189750672, now seen corresponding path program 1 times [2025-01-09 00:21:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:02,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779067269] [2025-01-09 00:21:02,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:02,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:02,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-01-09 00:21:02,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-01-09 00:21:02,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:02,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-01-09 00:21:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:02,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779067269] [2025-01-09 00:21:02,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779067269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:02,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:02,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:02,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704805806] [2025-01-09 00:21:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:02,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:02,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:02,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:02,978 INFO L87 Difference]: Start difference. First operand 33124 states and 36309 transitions. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:04,402 INFO L93 Difference]: Finished difference Result 66246 states and 72616 transitions. [2025-01-09 00:21:04,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:04,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 496 [2025-01-09 00:21:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:04,438 INFO L225 Difference]: With dead ends: 66246 [2025-01-09 00:21:04,438 INFO L226 Difference]: Without dead ends: 33124 [2025-01-09 00:21:04,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-01-09 00:21:04,460 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 753 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:04,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 780 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:21:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33124 states. [2025-01-09 00:21:04,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33124 to 33124. [2025-01-09 00:21:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33124 states, 33123 states have (on average 1.0810011170485765) internal successors, (35806), 33123 states have internal predecessors, (35806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 35806 transitions. [2025-01-09 00:21:04,813 INFO L78 Accepts]: Start accepts. Automaton has 33124 states and 35806 transitions. Word has length 496 [2025-01-09 00:21:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:04,814 INFO L471 AbstractCegarLoop]: Abstraction has 33124 states and 35806 transitions. [2025-01-09 00:21:04,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 33124 states and 35806 transitions. [2025-01-09 00:21:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-01-09 00:21:04,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:04,820 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:21:04,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:21:04,820 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:04,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1961811745, now seen corresponding path program 1 times [2025-01-09 00:21:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:04,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141814190] [2025-01-09 00:21:04,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:04,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 00:21:04,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 00:21:04,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:04,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 335 proven. 252 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 00:21:05,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:05,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141814190] [2025-01-09 00:21:05,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141814190] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:21:05,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457377422] [2025-01-09 00:21:05,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:05,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:21:05,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:21:05,611 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-01-09 00:21:05,613 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-01-09 00:21:05,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 00:21:05,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 00:21:05,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:05,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:05,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:21:05,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:21:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-01-09 00:21:05,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:21:05,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457377422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:05,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:21:05,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:21:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122948946] [2025-01-09 00:21:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:05,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:05,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:05,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:05,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:21:05,891 INFO L87 Difference]: Start difference. First operand 33124 states and 35806 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:07,662 INFO L93 Difference]: Finished difference Result 73836 states and 80701 transitions. [2025-01-09 00:21:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:07,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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 598 [2025-01-09 00:21:07,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:07,709 INFO L225 Difference]: With dead ends: 73836 [2025-01-09 00:21:07,709 INFO L226 Difference]: Without dead ends: 40714 [2025-01-09 00:21:07,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:21:07,731 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 699 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:07,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 165 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:21:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40714 states. [2025-01-09 00:21:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40714 to 40714. [2025-01-09 00:21:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40714 states, 40713 states have (on average 1.083314911698966) internal successors, (44105), 40713 states have internal predecessors, (44105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40714 states to 40714 states and 44105 transitions. [2025-01-09 00:21:08,130 INFO L78 Accepts]: Start accepts. Automaton has 40714 states and 44105 transitions. Word has length 598 [2025-01-09 00:21:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:08,131 INFO L471 AbstractCegarLoop]: Abstraction has 40714 states and 44105 transitions. [2025-01-09 00:21:08,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 40714 states and 44105 transitions. [2025-01-09 00:21:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-01-09 00:21:08,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:08,137 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:21:08,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:21:08,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 00:21:08,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:08,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1661748336, now seen corresponding path program 1 times [2025-01-09 00:21:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:08,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535516863] [2025-01-09 00:21:08,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:08,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:08,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-01-09 00:21:08,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-01-09 00:21:08,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:08,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-01-09 00:21:08,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:08,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535516863] [2025-01-09 00:21:08,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535516863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:08,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:08,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:08,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871646295] [2025-01-09 00:21:08,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:08,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:08,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:08,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:08,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:08,566 INFO L87 Difference]: Start difference. First operand 40714 states and 44105 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:10,180 INFO L93 Difference]: Finished difference Result 92466 states and 101139 transitions. [2025-01-09 00:21:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:10,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 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 604 [2025-01-09 00:21:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:10,229 INFO L225 Difference]: With dead ends: 92466 [2025-01-09 00:21:10,229 INFO L226 Difference]: Without dead ends: 48304 [2025-01-09 00:21:10,258 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-01-09 00:21:10,259 INFO L435 NwaCegarLoop]: 1114 mSDtfsCounter, 603 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:10,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1121 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:21:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48304 states. [2025-01-09 00:21:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48304 to 48304. [2025-01-09 00:21:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48304 states, 48303 states have (on average 1.0776763348032212) internal successors, (52055), 48303 states have internal predecessors, (52055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48304 states to 48304 states and 52055 transitions. [2025-01-09 00:21:10,696 INFO L78 Accepts]: Start accepts. Automaton has 48304 states and 52055 transitions. Word has length 604 [2025-01-09 00:21:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:10,697 INFO L471 AbstractCegarLoop]: Abstraction has 48304 states and 52055 transitions. [2025-01-09 00:21:10,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 48304 states and 52055 transitions. [2025-01-09 00:21:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-01-09 00:21:10,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:10,705 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:21:10,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:21:10,706 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:10,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1608575305, now seen corresponding path program 1 times [2025-01-09 00:21:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:10,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292661955] [2025-01-09 00:21:10,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:10,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-01-09 00:21:10,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-01-09 00:21:10,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:10,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-01-09 00:21:11,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292661955] [2025-01-09 00:21:11,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292661955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:11,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:11,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:11,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895970005] [2025-01-09 00:21:11,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:11,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:11,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:11,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:11,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:11,039 INFO L87 Difference]: Start difference. First operand 48304 states and 52055 transitions. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:12,605 INFO L93 Difference]: Finished difference Result 107646 states and 116961 transitions. [2025-01-09 00:21:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:12,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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 622 [2025-01-09 00:21:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:12,666 INFO L225 Difference]: With dead ends: 107646 [2025-01-09 00:21:12,666 INFO L226 Difference]: Without dead ends: 54514 [2025-01-09 00:21:12,698 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-01-09 00:21:12,699 INFO L435 NwaCegarLoop]: 1047 mSDtfsCounter, 650 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 2190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:12,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1054 Invalid, 2190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:21:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54514 states. [2025-01-09 00:21:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54514 to 51754. [2025-01-09 00:21:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51754 states, 51753 states have (on average 1.0468378644716247) internal successors, (54177), 51753 states have internal predecessors, (54177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51754 states to 51754 states and 54177 transitions. [2025-01-09 00:21:13,240 INFO L78 Accepts]: Start accepts. Automaton has 51754 states and 54177 transitions. Word has length 622 [2025-01-09 00:21:13,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:13,241 INFO L471 AbstractCegarLoop]: Abstraction has 51754 states and 54177 transitions. [2025-01-09 00:21:13,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 51754 states and 54177 transitions. [2025-01-09 00:21:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2025-01-09 00:21:13,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:13,256 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:21:13,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:21:13,256 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:13,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash -716378475, now seen corresponding path program 1 times [2025-01-09 00:21:13,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:13,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635821530] [2025-01-09 00:21:13,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:13,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 837 statements into 1 equivalence classes. [2025-01-09 00:21:13,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 837 of 837 statements. [2025-01-09 00:21:13,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:13,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 911 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-09 00:21:13,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:13,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635821530] [2025-01-09 00:21:13,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635821530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:13,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:13,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:13,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032975217] [2025-01-09 00:21:13,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:13,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:13,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:13,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:13,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:13,590 INFO L87 Difference]: Start difference. First operand 51754 states and 54177 transitions. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:15,525 INFO L93 Difference]: Finished difference Result 113166 states and 118762 transitions. [2025-01-09 00:21:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:15,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 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 837 [2025-01-09 00:21:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:15,594 INFO L225 Difference]: With dead ends: 113166 [2025-01-09 00:21:15,594 INFO L226 Difference]: Without dead ends: 61414 [2025-01-09 00:21:15,628 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-01-09 00:21:15,629 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 455 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:15,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 963 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:21:15,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61414 states. [2025-01-09 00:21:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61414 to 61414. [2025-01-09 00:21:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.0435901193558368) internal successors, (64090), 61413 states have internal predecessors, (64090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 64090 transitions. [2025-01-09 00:21:16,293 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 64090 transitions. Word has length 837 [2025-01-09 00:21:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:16,293 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 64090 transitions. [2025-01-09 00:21:16,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 64090 transitions. [2025-01-09 00:21:16,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 867 [2025-01-09 00:21:16,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:16,310 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:21:16,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:21:16,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:16,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:16,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2043242960, now seen corresponding path program 1 times [2025-01-09 00:21:16,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:16,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550840275] [2025-01-09 00:21:16,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:16,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:16,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 866 statements into 1 equivalence classes. [2025-01-09 00:21:16,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 866 of 866 statements. [2025-01-09 00:21:16,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:16,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 915 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-01-09 00:21:17,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:17,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550840275] [2025-01-09 00:21:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550840275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852619772] [2025-01-09 00:21:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:17,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:21:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:17,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:21:17,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:21:17,100 INFO L87 Difference]: Start difference. First operand 61414 states and 64090 transitions. Second operand has 4 states, 4 states have (on average 152.5) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:19,456 INFO L93 Difference]: Finished difference Result 124206 states and 129562 transitions. [2025-01-09 00:21:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:21:19,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 152.5) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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 866 [2025-01-09 00:21:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:19,507 INFO L225 Difference]: With dead ends: 124206 [2025-01-09 00:21:19,507 INFO L226 Difference]: Without dead ends: 62794 [2025-01-09 00:21:19,530 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-01-09 00:21:19,530 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1403 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:19,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 90 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 2678 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:21:19,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62794 states. [2025-01-09 00:21:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62794 to 61414. [2025-01-09 00:21:19,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.0380538322505006) internal successors, (63750), 61413 states have internal predecessors, (63750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 63750 transitions. [2025-01-09 00:21:19,993 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 63750 transitions. Word has length 866 [2025-01-09 00:21:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:19,994 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 63750 transitions. [2025-01-09 00:21:19,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.5) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 63750 transitions. [2025-01-09 00:21:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1461 [2025-01-09 00:21:20,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:20,025 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:21:20,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:21:20,025 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:20,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:20,026 INFO L85 PathProgramCache]: Analyzing trace with hash -341226004, now seen corresponding path program 1 times [2025-01-09 00:21:20,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:20,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259600803] [2025-01-09 00:21:20,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:20,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:20,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1460 statements into 1 equivalence classes. [2025-01-09 00:21:20,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1460 of 1460 statements. [2025-01-09 00:21:20,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:20,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 796 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-01-09 00:21:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:22,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259600803] [2025-01-09 00:21:22,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259600803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:22,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:22,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:22,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106597554] [2025-01-09 00:21:22,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:22,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:22,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:22,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:22,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:22,818 INFO L87 Difference]: Start difference. First operand 61414 states and 63750 transitions. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:24,408 INFO L93 Difference]: Finished difference Result 122826 states and 127507 transitions. [2025-01-09 00:21:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:24,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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 1460 [2025-01-09 00:21:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:24,474 INFO L225 Difference]: With dead ends: 122826 [2025-01-09 00:21:24,474 INFO L226 Difference]: Without dead ends: 62104 [2025-01-09 00:21:24,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-01-09 00:21:24,504 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 645 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:24,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 758 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:21:24,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62104 states. [2025-01-09 00:21:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62104 to 62104. [2025-01-09 00:21:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62104 states, 62103 states have (on average 1.032913063781138) internal successors, (64147), 62103 states have internal predecessors, (64147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62104 states to 62104 states and 64147 transitions. [2025-01-09 00:21:25,004 INFO L78 Accepts]: Start accepts. Automaton has 62104 states and 64147 transitions. Word has length 1460 [2025-01-09 00:21:25,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:25,005 INFO L471 AbstractCegarLoop]: Abstraction has 62104 states and 64147 transitions. [2025-01-09 00:21:25,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 62104 states and 64147 transitions. [2025-01-09 00:21:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1510 [2025-01-09 00:21:25,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:25,036 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:21:25,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:21:25,036 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:25,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:25,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1221855326, now seen corresponding path program 1 times [2025-01-09 00:21:25,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:25,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814958394] [2025-01-09 00:21:25,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:25,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:25,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1509 statements into 1 equivalence classes. [2025-01-09 00:21:25,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1509 of 1509 statements. [2025-01-09 00:21:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2142 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 1889 trivial. 0 not checked. [2025-01-09 00:21:26,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:26,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814958394] [2025-01-09 00:21:26,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814958394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:26,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:26,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:26,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635128616] [2025-01-09 00:21:26,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:26,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:26,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:26,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:26,208 INFO L87 Difference]: Start difference. First operand 62104 states and 64147 transitions. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:28,009 INFO L93 Difference]: Finished difference Result 146286 states and 151273 transitions. [2025-01-09 00:21:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:28,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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 1509 [2025-01-09 00:21:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:28,092 INFO L225 Difference]: With dead ends: 146286 [2025-01-09 00:21:28,092 INFO L226 Difference]: Without dead ends: 84184 [2025-01-09 00:21:28,134 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-01-09 00:21:28,134 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 674 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1811 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:28,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 941 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1811 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:21:28,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84184 states. [2025-01-09 00:21:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84184 to 83494. [2025-01-09 00:21:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83494 states, 83493 states have (on average 1.0305055513635875) internal successors, (86040), 83493 states have internal predecessors, (86040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83494 states to 83494 states and 86040 transitions. [2025-01-09 00:21:28,878 INFO L78 Accepts]: Start accepts. Automaton has 83494 states and 86040 transitions. Word has length 1509 [2025-01-09 00:21:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:28,879 INFO L471 AbstractCegarLoop]: Abstraction has 83494 states and 86040 transitions. [2025-01-09 00:21:28,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 83494 states and 86040 transitions. [2025-01-09 00:21:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1515 [2025-01-09 00:21:28,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:28,903 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:21:28,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:21:28,903 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:28,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash -855802010, now seen corresponding path program 1 times [2025-01-09 00:21:28,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:28,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759486641] [2025-01-09 00:21:28,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:28,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:29,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1514 statements into 1 equivalence classes. [2025-01-09 00:21:29,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1514 of 1514 statements. [2025-01-09 00:21:29,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:29,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3221 backedges. 1684 proven. 0 refuted. 0 times theorem prover too weak. 1537 trivial. 0 not checked. [2025-01-09 00:21:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:29,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759486641] [2025-01-09 00:21:29,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759486641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:29,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:29,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341621285] [2025-01-09 00:21:29,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:29,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:29,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:29,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:29,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:29,990 INFO L87 Difference]: Start difference. First operand 83494 states and 86040 transitions. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:31,726 INFO L93 Difference]: Finished difference Result 166986 states and 172078 transitions. [2025-01-09 00:21:31,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:31,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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 1514 [2025-01-09 00:21:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:31,816 INFO L225 Difference]: With dead ends: 166986 [2025-01-09 00:21:31,816 INFO L226 Difference]: Without dead ends: 82804 [2025-01-09 00:21:31,866 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-01-09 00:21:31,867 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 625 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:31,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 951 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:21:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82804 states. [2025-01-09 00:21:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82804 to 81424. [2025-01-09 00:21:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81424 states, 81423 states have (on average 1.024833278066394) internal successors, (83445), 81423 states have internal predecessors, (83445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81424 states to 81424 states and 83445 transitions. [2025-01-09 00:21:32,606 INFO L78 Accepts]: Start accepts. Automaton has 81424 states and 83445 transitions. Word has length 1514 [2025-01-09 00:21:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:32,607 INFO L471 AbstractCegarLoop]: Abstraction has 81424 states and 83445 transitions. [2025-01-09 00:21:32,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 81424 states and 83445 transitions. [2025-01-09 00:21:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1796 [2025-01-09 00:21:32,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:32,652 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:21:32,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:21:32,652 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:32,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash -264953121, now seen corresponding path program 1 times [2025-01-09 00:21:32,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:32,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945157853] [2025-01-09 00:21:32,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:32,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:32,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1795 statements into 1 equivalence classes. [2025-01-09 00:21:32,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1795 of 1795 statements. [2025-01-09 00:21:32,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:32,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 934 proven. 1854 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2025-01-09 00:21:35,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:35,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945157853] [2025-01-09 00:21:35,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945157853] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:21:35,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894006377] [2025-01-09 00:21:35,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:35,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:21:35,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:21:35,100 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-01-09 00:21:35,101 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-01-09 00:21:35,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1795 statements into 1 equivalence classes. [2025-01-09 00:21:35,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1795 of 1795 statements. [2025-01-09 00:21:35,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:35,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:35,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 2043 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:21:35,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:21:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 2049 proven. 0 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2025-01-09 00:21:36,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:21:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894006377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:36,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:21:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:21:36,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838226190] [2025-01-09 00:21:36,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:36,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:36,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:21:36,030 INFO L87 Difference]: Start difference. First operand 81424 states and 83445 transitions. Second operand has 3 states, 3 states have (on average 316.6666666666667) internal successors, (950), 3 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:37,580 INFO L93 Difference]: Finished difference Result 159396 states and 163348 transitions. [2025-01-09 00:21:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:37,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 316.6666666666667) internal successors, (950), 3 states have internal predecessors, (950), 0 states have call successors, (0), 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 1795 [2025-01-09 00:21:37,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:37,679 INFO L225 Difference]: With dead ends: 159396 [2025-01-09 00:21:37,680 INFO L226 Difference]: Without dead ends: 78664 [2025-01-09 00:21:37,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1801 GetRequests, 1795 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:21:37,732 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 372 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:37,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 887 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:21:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78664 states. [2025-01-09 00:21:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78664 to 77284. [2025-01-09 00:21:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77284 states, 77283 states have (on average 1.0178435102157006) internal successors, (78662), 77283 states have internal predecessors, (78662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77284 states to 77284 states and 78662 transitions. [2025-01-09 00:21:38,638 INFO L78 Accepts]: Start accepts. Automaton has 77284 states and 78662 transitions. Word has length 1795 [2025-01-09 00:21:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:38,640 INFO L471 AbstractCegarLoop]: Abstraction has 77284 states and 78662 transitions. [2025-01-09 00:21:38,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.6666666666667) internal successors, (950), 3 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand 77284 states and 78662 transitions. [2025-01-09 00:21:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1871 [2025-01-09 00:21:38,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:38,715 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:21:38,722 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-01-09 00:21:38,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:21:38,916 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:38,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:38,917 INFO L85 PathProgramCache]: Analyzing trace with hash -819679512, now seen corresponding path program 1 times [2025-01-09 00:21:38,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:38,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393478156] [2025-01-09 00:21:38,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:38,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:39,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1870 statements into 1 equivalence classes. [2025-01-09 00:21:39,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1870 of 1870 statements. [2025-01-09 00:21:39,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:39,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3237 backedges. 2225 proven. 501 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2025-01-09 00:21:43,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393478156] [2025-01-09 00:21:43,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393478156] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:21:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557236716] [2025-01-09 00:21:43,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:43,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:21:43,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:21:43,115 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-01-09 00:21:43,116 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-01-09 00:21:43,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1870 statements into 1 equivalence classes. [2025-01-09 00:21:43,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1870 of 1870 statements. [2025-01-09 00:21:43,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:43,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:43,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 2091 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:21:43,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:21:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3237 backedges. 2300 proven. 0 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2025-01-09 00:21:43,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:21:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557236716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:43,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:21:43,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 00:21:43,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764458832] [2025-01-09 00:21:43,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:43,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:43,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:43,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:21:43,768 INFO L87 Difference]: Start difference. First operand 77284 states and 78662 transitions. Second operand has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:45,075 INFO L93 Difference]: Finished difference Result 153876 states and 156631 transitions. [2025-01-09 00:21:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:45,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 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 1870 [2025-01-09 00:21:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:45,154 INFO L225 Difference]: With dead ends: 153876 [2025-01-09 00:21:45,154 INFO L226 Difference]: Without dead ends: 77284 [2025-01-09 00:21:45,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1879 GetRequests, 1871 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:21:45,206 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 573 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:45,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 975 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:21:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77284 states. [2025-01-09 00:21:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77284 to 75214. [2025-01-09 00:21:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75214 states, 75213 states have (on average 1.0180155026391715) internal successors, (76568), 75213 states have internal predecessors, (76568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75214 states to 75214 states and 76568 transitions. [2025-01-09 00:21:45,809 INFO L78 Accepts]: Start accepts. Automaton has 75214 states and 76568 transitions. Word has length 1870 [2025-01-09 00:21:45,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:45,810 INFO L471 AbstractCegarLoop]: Abstraction has 75214 states and 76568 transitions. [2025-01-09 00:21:45,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 75214 states and 76568 transitions. [2025-01-09 00:21:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1880 [2025-01-09 00:21:45,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:45,862 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:21:45,869 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-01-09 00:21:46,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:21:46,063 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:46,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:46,063 INFO L85 PathProgramCache]: Analyzing trace with hash 354044575, now seen corresponding path program 1 times [2025-01-09 00:21:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:46,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258441833] [2025-01-09 00:21:46,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:46,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:46,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1879 statements into 1 equivalence classes. [2025-01-09 00:21:46,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1879 of 1879 statements. [2025-01-09 00:21:46,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:46,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 2651 proven. 0 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2025-01-09 00:21:47,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:47,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258441833] [2025-01-09 00:21:47,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258441833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:47,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:47,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996116615] [2025-01-09 00:21:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:47,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:47,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:47,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:47,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:47,177 INFO L87 Difference]: Start difference. First operand 75214 states and 76568 transitions. Second operand has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:48,667 INFO L93 Difference]: Finished difference Result 173196 states and 176491 transitions. [2025-01-09 00:21:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:48,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 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 1879 [2025-01-09 00:21:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:48,764 INFO L225 Difference]: With dead ends: 173196 [2025-01-09 00:21:48,764 INFO L226 Difference]: Without dead ends: 98674 [2025-01-09 00:21:48,814 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-01-09 00:21:48,815 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 340 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:48,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 232 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:21:48,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98674 states. [2025-01-09 00:21:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98674 to 97294. [2025-01-09 00:21:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97294 states, 97293 states have (on average 1.0172263163845292) internal successors, (98969), 97293 states have internal predecessors, (98969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97294 states to 97294 states and 98969 transitions. [2025-01-09 00:21:49,969 INFO L78 Accepts]: Start accepts. Automaton has 97294 states and 98969 transitions. Word has length 1879 [2025-01-09 00:21:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:49,969 INFO L471 AbstractCegarLoop]: Abstraction has 97294 states and 98969 transitions. [2025-01-09 00:21:49,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 97294 states and 98969 transitions. [2025-01-09 00:21:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1924 [2025-01-09 00:21:50,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:50,022 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:21:50,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:21:50,022 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:50,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:50,023 INFO L85 PathProgramCache]: Analyzing trace with hash -227091949, now seen corresponding path program 1 times [2025-01-09 00:21:50,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:50,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091510762] [2025-01-09 00:21:50,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:50,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms