./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label36.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_label36.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 ff7b66f39bf13c274f6666e6cfc3b11f3c040d17457aff74de240209d6835c4a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:20:03,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:20:03,941 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:03,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:20:03,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:20:03,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:20:03,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:20:03,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:20:03,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:20:03,968 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:20:03,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:20:03,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:20:03,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:20:03,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:20:03,969 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:20:03,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:20:03,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:20:03,972 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:20:03,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:20:03,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:20:03,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:20:03,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:20:03,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:20:03,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:20:03,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:20:03,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:20:03,975 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:20:03,975 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:20:03,975 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:20:03,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:20:03,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:20:03,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:20:03,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:20:03,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:20:03,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:20:03,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:20:03,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:20:03,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:20:03,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:20:03,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:20:03,976 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:20:03,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:20:03,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:20:03,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:20:03,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:20:03,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:20:03,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:20:03,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:20:03,976 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 -> ff7b66f39bf13c274f6666e6cfc3b11f3c040d17457aff74de240209d6835c4a [2025-01-09 00:20:04,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:20:04,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:20:04,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:20:04,339 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:20:04,340 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:20:04,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label36.c [2025-01-09 00:20:05,734 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c36a5978a/c1aead168f6145ee980a3d90c228772f/FLAG28433ebb1 [2025-01-09 00:20:06,178 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:20:06,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label36.c [2025-01-09 00:20:06,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c36a5978a/c1aead168f6145ee980a3d90c228772f/FLAG28433ebb1 [2025-01-09 00:20:06,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c36a5978a/c1aead168f6145ee980a3d90c228772f [2025-01-09 00:20:06,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:20:06,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:20:06,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:20:06,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:20:06,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:20:06,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:20:06" (1/1) ... [2025-01-09 00:20:06,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d3782e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:06, skipping insertion in model container [2025-01-09 00:20:06,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:20:06" (1/1) ... [2025-01-09 00:20:06,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:20:06,501 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_label36.c[3084,3097] [2025-01-09 00:20:06,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:20:07,003 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:20:07,017 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_label36.c[3084,3097] [2025-01-09 00:20:07,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:20:07,288 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:20:07,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:07 WrapperNode [2025-01-09 00:20:07,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:20:07,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:20:07,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:20:07,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:20:07,296 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:07" (1/1) ... [2025-01-09 00:20:07,335 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:07" (1/1) ... [2025-01-09 00:20:07,546 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-01-09 00:20:07,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:20:07,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:20:07,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:20:07,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:20:07,556 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:07" (1/1) ... [2025-01-09 00:20:07,556 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:07" (1/1) ... [2025-01-09 00:20:07,594 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:07" (1/1) ... [2025-01-09 00:20:07,718 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:07,719 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:07" (1/1) ... [2025-01-09 00:20:07,719 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:07" (1/1) ... [2025-01-09 00:20:07,792 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:07" (1/1) ... [2025-01-09 00:20:07,805 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:07" (1/1) ... [2025-01-09 00:20:07,837 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:07" (1/1) ... [2025-01-09 00:20:07,855 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:07" (1/1) ... [2025-01-09 00:20:07,878 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:07" (1/1) ... [2025-01-09 00:20:07,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:20:07,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:20:07,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:20:07,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:20:07,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:07" (1/1) ... [2025-01-09 00:20:07,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:20:07,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:20:07,943 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:07,946 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:08,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:20:08,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:20:08,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:20:08,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:20:08,069 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:20:08,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:20:11,615 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-01-09 00:20:11,615 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:20:11,680 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:20:11,680 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:20:11,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:20:11 BoogieIcfgContainer [2025-01-09 00:20:11,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:20:11,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:20:11,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:20:11,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:20:11,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:20:06" (1/3) ... [2025-01-09 00:20:11,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a88a2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:20:11, skipping insertion in model container [2025-01-09 00:20:11,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:20:07" (2/3) ... [2025-01-09 00:20:11,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a88a2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:20:11, skipping insertion in model container [2025-01-09 00:20:11,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:20:11" (3/3) ... [2025-01-09 00:20:11,693 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label36.c [2025-01-09 00:20:11,706 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:20:11,708 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label36.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:20:11,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:20:11,799 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;@1d47e6bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:20:11,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:20:11,808 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:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 00:20:11,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:11,815 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] [2025-01-09 00:20:11,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:11,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash 271890780, now seen corresponding path program 1 times [2025-01-09 00:20:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572360856] [2025-01-09 00:20:11,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:11,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:11,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 00:20:11,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 00:20:11,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:11,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:12,113 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:12,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:12,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572360856] [2025-01-09 00:20:12,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572360856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:12,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:12,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:20:12,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283069175] [2025-01-09 00:20:12,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:12,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:12,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:12,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:12,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:12,144 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 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:15,229 INFO L93 Difference]: Finished difference Result 2205 states and 4263 transitions. [2025-01-09 00:20:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:15,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-01-09 00:20:15,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:15,249 INFO L225 Difference]: With dead ends: 2205 [2025-01-09 00:20:15,249 INFO L226 Difference]: Without dead ends: 1384 [2025-01-09 00:20:15,254 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:15,257 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 721 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 967 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 967 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:15,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 291 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [967 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 00:20:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-01-09 00:20:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-01-09 00:20:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.7339117859725235) internal successors, (2398), 1383 states have internal predecessors, (2398), 0 states have call successors, (0), 0 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:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2398 transitions. [2025-01-09 00:20:15,366 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2398 transitions. Word has length 27 [2025-01-09 00:20:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:15,367 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2398 transitions. [2025-01-09 00:20:15,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2398 transitions. [2025-01-09 00:20:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 00:20:15,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:15,370 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:20:15,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:15,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:15,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1226037220, now seen corresponding path program 1 times [2025-01-09 00:20:15,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:15,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576323599] [2025-01-09 00:20:15,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:15,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:15,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 00:20:15,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 00:20:15,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:15,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:20:15,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:15,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576323599] [2025-01-09 00:20:15,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576323599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:15,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:15,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:15,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172718833] [2025-01-09 00:20:15,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:15,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:20:15,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:15,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:20:15,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:20:15,749 INFO L87 Difference]: Start difference. First operand 1384 states and 2398 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:19,912 INFO L93 Difference]: Finished difference Result 4842 states and 8275 transitions. [2025-01-09 00:20:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:20:19,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 00:20:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:19,928 INFO L225 Difference]: With dead ends: 4842 [2025-01-09 00:20:19,928 INFO L226 Difference]: Without dead ends: 3460 [2025-01-09 00:20:19,931 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:19,932 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 2034 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3268 mSolverCounterSat, 1420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 4688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1420 IncrementalHoareTripleChecker+Valid, 3268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:19,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 137 Invalid, 4688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1420 Valid, 3268 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 00:20:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2025-01-09 00:20:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3454. [2025-01-09 00:20:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 3453 states have (on average 1.540689255719664) internal successors, (5320), 3453 states have internal predecessors, (5320), 0 states have call successors, (0), 0 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:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 5320 transitions. [2025-01-09 00:20:20,007 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 5320 transitions. Word has length 96 [2025-01-09 00:20:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:20,008 INFO L471 AbstractCegarLoop]: Abstraction has 3454 states and 5320 transitions. [2025-01-09 00:20:20,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 5320 transitions. [2025-01-09 00:20:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 00:20:20,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:20,021 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:20:20,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:20:20,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:20,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:20,026 INFO L85 PathProgramCache]: Analyzing trace with hash 475289544, now seen corresponding path program 1 times [2025-01-09 00:20:20,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:20,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723820599] [2025-01-09 00:20:20,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:20,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:20,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 00:20:20,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 00:20:20,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:20,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 00:20:20,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:20,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723820599] [2025-01-09 00:20:20,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723820599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:20,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:20,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:20,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864912323] [2025-01-09 00:20:20,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:20,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:20:20,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:20,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:20:20,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:20:20,698 INFO L87 Difference]: Start difference. First operand 3454 states and 5320 transitions. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 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:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:24,287 INFO L93 Difference]: Finished difference Result 11046 states and 17161 transitions. [2025-01-09 00:20:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:20:24,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 205 [2025-01-09 00:20:24,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:24,319 INFO L225 Difference]: With dead ends: 11046 [2025-01-09 00:20:24,319 INFO L226 Difference]: Without dead ends: 7594 [2025-01-09 00:20:24,325 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:24,329 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1923 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4378 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 5006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 4378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:24,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 647 Invalid, 5006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 4378 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 00:20:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2025-01-09 00:20:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 6904. [2025-01-09 00:20:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.326959293060988) internal successors, (9160), 6903 states have internal predecessors, (9160), 0 states have call successors, (0), 0 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:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 9160 transitions. [2025-01-09 00:20:24,457 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 9160 transitions. Word has length 205 [2025-01-09 00:20:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:24,458 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 9160 transitions. [2025-01-09 00:20:24,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 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:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 9160 transitions. [2025-01-09 00:20:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 00:20:24,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:24,463 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:20:24,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:20:24,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:24,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash -505703092, now seen corresponding path program 1 times [2025-01-09 00:20:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:24,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705624481] [2025-01-09 00:20:24,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:24,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:24,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 00:20:24,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 00:20:24,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:24,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:20:24,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:24,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705624481] [2025-01-09 00:20:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705624481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:24,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:24,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531526866] [2025-01-09 00:20:24,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:24,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:20:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:24,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:20:24,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:20:24,927 INFO L87 Difference]: Start difference. First operand 6904 states and 9160 transitions. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:27,549 INFO L93 Difference]: Finished difference Result 16619 states and 22097 transitions. [2025-01-09 00:20:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:20:27,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2025-01-09 00:20:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:27,577 INFO L225 Difference]: With dead ends: 16619 [2025-01-09 00:20:27,577 INFO L226 Difference]: Without dead ends: 9664 [2025-01-09 00:20:27,587 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:27,588 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:27,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 637 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 00:20:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9664 states. [2025-01-09 00:20:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9664 to 8974. [2025-01-09 00:20:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8973 states have (on average 1.1907946060403432) internal successors, (10685), 8973 states have internal predecessors, (10685), 0 states have call successors, (0), 0 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:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 10685 transitions. [2025-01-09 00:20:27,854 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 10685 transitions. Word has length 294 [2025-01-09 00:20:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:27,859 INFO L471 AbstractCegarLoop]: Abstraction has 8974 states and 10685 transitions. [2025-01-09 00:20:27,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 10685 transitions. [2025-01-09 00:20:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2025-01-09 00:20:27,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:27,894 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:20:27,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:27,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2094498940, now seen corresponding path program 1 times [2025-01-09 00:20:27,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:27,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562246054] [2025-01-09 00:20:27,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:27,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 926 statements into 1 equivalence classes. [2025-01-09 00:20:28,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 926 of 926 statements. [2025-01-09 00:20:28,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:28,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-01-09 00:20:28,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:28,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562246054] [2025-01-09 00:20:28,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562246054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:28,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:28,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:20:28,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503485991] [2025-01-09 00:20:28,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:28,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:28,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:28,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:28,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:28,797 INFO L87 Difference]: Start difference. First operand 8974 states and 10685 transitions. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 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:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:30,760 INFO L93 Difference]: Finished difference Result 20016 states and 24051 transitions. [2025-01-09 00:20:30,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:30,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 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 926 [2025-01-09 00:20:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:30,808 INFO L225 Difference]: With dead ends: 20016 [2025-01-09 00:20:30,809 INFO L226 Difference]: Without dead ends: 11044 [2025-01-09 00:20:30,819 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:30,820 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:30,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 77 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:20:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11044 states. [2025-01-09 00:20:31,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11044 to 11044. [2025-01-09 00:20:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11044 states, 11043 states have (on average 1.1927012587159287) internal successors, (13171), 11043 states have internal predecessors, (13171), 0 states have call successors, (0), 0 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:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 13171 transitions. [2025-01-09 00:20:31,125 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 13171 transitions. Word has length 926 [2025-01-09 00:20:31,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:31,127 INFO L471 AbstractCegarLoop]: Abstraction has 11044 states and 13171 transitions. [2025-01-09 00:20:31,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 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:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 13171 transitions. [2025-01-09 00:20:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2025-01-09 00:20:31,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:31,188 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:20:31,189 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:31,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:31,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1443634186, now seen corresponding path program 1 times [2025-01-09 00:20:31,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:31,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103344837] [2025-01-09 00:20:31,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:31,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 931 statements into 1 equivalence classes. [2025-01-09 00:20:31,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 931 of 931 statements. [2025-01-09 00:20:31,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:31,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-01-09 00:20:32,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:32,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103344837] [2025-01-09 00:20:32,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103344837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:32,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:32,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:20:32,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535636337] [2025-01-09 00:20:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:32,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:32,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:32,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:32,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:32,196 INFO L87 Difference]: Start difference. First operand 11044 states and 13171 transitions. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 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:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:34,329 INFO L93 Difference]: Finished difference Result 26916 states and 33022 transitions. [2025-01-09 00:20:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:34,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 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 931 [2025-01-09 00:20:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:34,371 INFO L225 Difference]: With dead ends: 26916 [2025-01-09 00:20:34,371 INFO L226 Difference]: Without dead ends: 15874 [2025-01-09 00:20:34,385 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:34,386 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 226 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:34,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 389 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:20:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15874 states. [2025-01-09 00:20:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15874 to 14494. [2025-01-09 00:20:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14494 states, 14493 states have (on average 1.1620782446698406) internal successors, (16842), 14493 states have internal predecessors, (16842), 0 states have call successors, (0), 0 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:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 16842 transitions. [2025-01-09 00:20:34,615 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 16842 transitions. Word has length 931 [2025-01-09 00:20:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:34,617 INFO L471 AbstractCegarLoop]: Abstraction has 14494 states and 16842 transitions. [2025-01-09 00:20:34,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 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:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 16842 transitions. [2025-01-09 00:20:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2025-01-09 00:20:34,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:34,627 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:20:34,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:20:34,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:34,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:34,628 INFO L85 PathProgramCache]: Analyzing trace with hash 520095348, now seen corresponding path program 1 times [2025-01-09 00:20:34,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:34,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887178111] [2025-01-09 00:20:34,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:34,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:34,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1012 statements into 1 equivalence classes. [2025-01-09 00:20:34,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1012 of 1012 statements. [2025-01-09 00:20:34,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:34,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-01-09 00:20:35,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:35,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887178111] [2025-01-09 00:20:35,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887178111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:35,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:35,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:35,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358467661] [2025-01-09 00:20:35,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:35,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:35,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:35,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:35,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:35,440 INFO L87 Difference]: Start difference. First operand 14494 states and 16842 transitions. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 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,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:37,437 INFO L93 Difference]: Finished difference Result 35196 states and 41357 transitions. [2025-01-09 00:20:37,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:37,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 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 1012 [2025-01-09 00:20:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:37,485 INFO L225 Difference]: With dead ends: 35196 [2025-01-09 00:20:37,485 INFO L226 Difference]: Without dead ends: 20704 [2025-01-09 00:20:37,502 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:37,504 INFO L435 NwaCegarLoop]: 1115 mSDtfsCounter, 667 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:37,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1122 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:20:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20704 states. [2025-01-09 00:20:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20704 to 20014. [2025-01-09 00:20:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20014 states, 20013 states have (on average 1.1490531154749413) internal successors, (22996), 20013 states have internal predecessors, (22996), 0 states have call successors, (0), 0 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,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20014 states to 20014 states and 22996 transitions. [2025-01-09 00:20:37,897 INFO L78 Accepts]: Start accepts. Automaton has 20014 states and 22996 transitions. Word has length 1012 [2025-01-09 00:20:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:37,898 INFO L471 AbstractCegarLoop]: Abstraction has 20014 states and 22996 transitions. [2025-01-09 00:20:37,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 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,900 INFO L276 IsEmpty]: Start isEmpty. Operand 20014 states and 22996 transitions. [2025-01-09 00:20:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1050 [2025-01-09 00:20:37,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:37,925 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:20:37,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:20:37,926 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:37,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:37,926 INFO L85 PathProgramCache]: Analyzing trace with hash 639573838, now seen corresponding path program 1 times [2025-01-09 00:20:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:37,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416652101] [2025-01-09 00:20:37,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:37,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:38,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1049 statements into 1 equivalence classes. [2025-01-09 00:20:38,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1049 of 1049 statements. [2025-01-09 00:20:38,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:38,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 579 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-01-09 00:20:39,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:39,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416652101] [2025-01-09 00:20:39,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416652101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:39,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:39,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:39,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850998767] [2025-01-09 00:20:39,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:39,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:39,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:39,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:39,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:39,179 INFO L87 Difference]: Start difference. First operand 20014 states and 22996 transitions. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 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:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:41,164 INFO L93 Difference]: Finished difference Result 46236 states and 53536 transitions. [2025-01-09 00:20:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:41,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 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 1049 [2025-01-09 00:20:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:41,225 INFO L225 Difference]: With dead ends: 46236 [2025-01-09 00:20:41,225 INFO L226 Difference]: Without dead ends: 26224 [2025-01-09 00:20:41,246 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:41,247 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 576 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:41,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1012 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:20:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26224 states. [2025-01-09 00:20:41,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26224 to 26224. [2025-01-09 00:20:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26224 states, 26223 states have (on average 1.1345002478740038) internal successors, (29750), 26223 states have internal predecessors, (29750), 0 states have call successors, (0), 0 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:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26224 states to 26224 states and 29750 transitions. [2025-01-09 00:20:41,539 INFO L78 Accepts]: Start accepts. Automaton has 26224 states and 29750 transitions. Word has length 1049 [2025-01-09 00:20:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:41,541 INFO L471 AbstractCegarLoop]: Abstraction has 26224 states and 29750 transitions. [2025-01-09 00:20:41,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 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:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 26224 states and 29750 transitions. [2025-01-09 00:20:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1127 [2025-01-09 00:20:41,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:41,555 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:20:41,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:20:41,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:41,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:41,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1606978518, now seen corresponding path program 1 times [2025-01-09 00:20:41,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:41,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404149536] [2025-01-09 00:20:41,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:41,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:41,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1126 statements into 1 equivalence classes. [2025-01-09 00:20:41,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1126 of 1126 statements. [2025-01-09 00:20:41,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:41,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1212 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2025-01-09 00:20:42,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:42,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404149536] [2025-01-09 00:20:42,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404149536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:42,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:42,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:20:42,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272773495] [2025-01-09 00:20:42,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:42,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:20:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:42,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:20:42,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:20:42,806 INFO L87 Difference]: Start difference. First operand 26224 states and 29750 transitions. Second operand has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 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:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:44,989 INFO L93 Difference]: Finished difference Result 59425 states and 67449 transitions. [2025-01-09 00:20:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:20:44,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 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 1126 [2025-01-09 00:20:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:45,021 INFO L225 Difference]: With dead ends: 59425 [2025-01-09 00:20:45,022 INFO L226 Difference]: Without dead ends: 29063 [2025-01-09 00:20:45,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:20:45,033 INFO L435 NwaCegarLoop]: 1114 mSDtfsCounter, 2035 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 1067 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 3560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1067 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:45,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 1123 Invalid, 3560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1067 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:20:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29063 states. [2025-01-09 00:20:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29063 to 28294. [2025-01-09 00:20:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28294 states, 28293 states have (on average 1.0818577033188421) internal successors, (30609), 28293 states have internal predecessors, (30609), 0 states have call successors, (0), 0 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,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28294 states to 28294 states and 30609 transitions. [2025-01-09 00:20:45,335 INFO L78 Accepts]: Start accepts. Automaton has 28294 states and 30609 transitions. Word has length 1126 [2025-01-09 00:20:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:45,336 INFO L471 AbstractCegarLoop]: Abstraction has 28294 states and 30609 transitions. [2025-01-09 00:20:45,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 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,337 INFO L276 IsEmpty]: Start isEmpty. Operand 28294 states and 30609 transitions. [2025-01-09 00:20:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1130 [2025-01-09 00:20:45,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:45,350 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:20:45,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:45,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1250771988, now seen corresponding path program 1 times [2025-01-09 00:20:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373038872] [2025-01-09 00:20:45,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:45,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:45,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1129 statements into 1 equivalence classes. [2025-01-09 00:20:45,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1129 of 1129 statements. [2025-01-09 00:20:45,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:45,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 808 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-01-09 00:20:46,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:46,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373038872] [2025-01-09 00:20:46,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373038872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:46,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:46,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:46,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648311214] [2025-01-09 00:20:46,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:46,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:46,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:46,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:46,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:46,695 INFO L87 Difference]: Start difference. First operand 28294 states and 30609 transitions. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 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,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:48,225 INFO L93 Difference]: Finished difference Result 60036 states and 65034 transitions. [2025-01-09 00:20:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:48,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 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 1129 [2025-01-09 00:20:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:48,260 INFO L225 Difference]: With dead ends: 60036 [2025-01-09 00:20:48,260 INFO L226 Difference]: Without dead ends: 31744 [2025-01-09 00:20:48,282 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:48,283 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 587 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:48,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 227 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:20:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31744 states. [2025-01-09 00:20:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31744 to 31744. [2025-01-09 00:20:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31744 states, 31743 states have (on average 1.0800806477018556) internal successors, (34285), 31743 states have internal predecessors, (34285), 0 states have call successors, (0), 0 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,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31744 states to 31744 states and 34285 transitions. [2025-01-09 00:20:48,689 INFO L78 Accepts]: Start accepts. Automaton has 31744 states and 34285 transitions. Word has length 1129 [2025-01-09 00:20:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:48,690 INFO L471 AbstractCegarLoop]: Abstraction has 31744 states and 34285 transitions. [2025-01-09 00:20:48,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 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,691 INFO L276 IsEmpty]: Start isEmpty. Operand 31744 states and 34285 transitions. [2025-01-09 00:20:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1138 [2025-01-09 00:20:48,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:48,704 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:20:48,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:20:48,705 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:48,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash -361856389, now seen corresponding path program 1 times [2025-01-09 00:20:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:48,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251756801] [2025-01-09 00:20:48,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:48,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1137 statements into 1 equivalence classes. [2025-01-09 00:20:48,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1137 of 1137 statements. [2025-01-09 00:20:48,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:48,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1287 backedges. 513 proven. 12 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-01-09 00:20:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251756801] [2025-01-09 00:20:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251756801] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:20:49,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801655630] [2025-01-09 00:20:49,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:49,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:20:49,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:20:49,506 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:20:49,507 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:20:49,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1137 statements into 1 equivalence classes. [2025-01-09 00:20:49,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1137 of 1137 statements. [2025-01-09 00:20:49,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:49,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:49,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:20:49,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:20:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1287 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2025-01-09 00:20:50,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:20:50,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801655630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:50,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:20:50,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:20:50,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301045485] [2025-01-09 00:20:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:50,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:50,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:50,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:50,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:20:50,005 INFO L87 Difference]: Start difference. First operand 31744 states and 34285 transitions. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 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,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:51,757 INFO L93 Difference]: Finished difference Result 80046 states and 86740 transitions. [2025-01-09 00:20:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:51,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 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 1137 [2025-01-09 00:20:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:51,805 INFO L225 Difference]: With dead ends: 80046 [2025-01-09 00:20:51,806 INFO L226 Difference]: Without dead ends: 48304 [2025-01-09 00:20:51,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1141 GetRequests, 1137 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:20:51,829 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 695 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:51,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 144 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:20:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48304 states. [2025-01-09 00:20:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48304 to 46234. [2025-01-09 00:20:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46234 states, 46233 states have (on average 1.0813271905348993) internal successors, (49993), 46233 states have internal predecessors, (49993), 0 states have call successors, (0), 0 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:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46234 states to 46234 states and 49993 transitions. [2025-01-09 00:20:52,233 INFO L78 Accepts]: Start accepts. Automaton has 46234 states and 49993 transitions. Word has length 1137 [2025-01-09 00:20:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:52,234 INFO L471 AbstractCegarLoop]: Abstraction has 46234 states and 49993 transitions. [2025-01-09 00:20:52,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 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:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 46234 states and 49993 transitions. [2025-01-09 00:20:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1415 [2025-01-09 00:20:52,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:52,260 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,267 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:20:52,461 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:20:52,461 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:52,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:52,462 INFO L85 PathProgramCache]: Analyzing trace with hash -330674075, now seen corresponding path program 1 times [2025-01-09 00:20:52,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:52,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113728102] [2025-01-09 00:20:52,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:52,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:52,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1414 statements into 1 equivalence classes. [2025-01-09 00:20:52,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1414 of 1414 statements. [2025-01-09 00:20:52,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:52,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1757 backedges. 995 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-01-09 00:20:53,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:53,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113728102] [2025-01-09 00:20:53,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113728102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:53,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:53,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:53,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473845472] [2025-01-09 00:20:53,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:53,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:53,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:53,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:53,422 INFO L87 Difference]: Start difference. First operand 46234 states and 49993 transitions. Second operand has 3 states, 3 states have (on average 309.6666666666667) internal successors, (929), 3 states have internal predecessors, (929), 0 states have call successors, (0), 0 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:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:55,161 INFO L93 Difference]: Finished difference Result 97296 states and 104879 transitions. [2025-01-09 00:20:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:55,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 309.6666666666667) internal successors, (929), 3 states have internal predecessors, (929), 0 states have call successors, (0), 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 1414 [2025-01-09 00:20:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:55,212 INFO L225 Difference]: With dead ends: 97296 [2025-01-09 00:20:55,212 INFO L226 Difference]: Without dead ends: 46234 [2025-01-09 00:20:55,231 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:55,231 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 328 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:55,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 934 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:20:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46234 states. [2025-01-09 00:20:55,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46234 to 46234. [2025-01-09 00:20:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46234 states, 46233 states have (on average 1.058010511971968) internal successors, (48915), 46233 states have internal predecessors, (48915), 0 states have call successors, (0), 0 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:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46234 states to 46234 states and 48915 transitions. [2025-01-09 00:20:55,740 INFO L78 Accepts]: Start accepts. Automaton has 46234 states and 48915 transitions. Word has length 1414 [2025-01-09 00:20:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:55,741 INFO L471 AbstractCegarLoop]: Abstraction has 46234 states and 48915 transitions. [2025-01-09 00:20:55,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.6666666666667) internal successors, (929), 3 states have internal predecessors, (929), 0 states have call successors, (0), 0 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:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 46234 states and 48915 transitions. [2025-01-09 00:20:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1501 [2025-01-09 00:20:55,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:55,783 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:20:55,783 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:55,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1408067385, now seen corresponding path program 1 times [2025-01-09 00:20:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253408775] [2025-01-09 00:20:55,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:55,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:55,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1500 statements into 1 equivalence classes. [2025-01-09 00:20:55,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1500 of 1500 statements. [2025-01-09 00:20:55,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:55,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 1355 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2025-01-09 00:20:56,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:56,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253408775] [2025-01-09 00:20:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253408775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:56,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:56,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:56,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600736464] [2025-01-09 00:20:56,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:56,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:56,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:56,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:56,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:56,582 INFO L87 Difference]: Start difference. First operand 46234 states and 48915 transitions. Second operand has 3 states, 3 states have (on average 364.6666666666667) internal successors, (1094), 3 states have internal predecessors, (1094), 0 states have call successors, (0), 0 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:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:58,333 INFO L93 Difference]: Finished difference Result 91086 states and 96443 transitions. [2025-01-09 00:20:58,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:58,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 364.6666666666667) internal successors, (1094), 3 states have internal predecessors, (1094), 0 states have call successors, (0), 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 1500 [2025-01-09 00:20:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:58,379 INFO L225 Difference]: With dead ends: 91086 [2025-01-09 00:20:58,379 INFO L226 Difference]: Without dead ends: 45544 [2025-01-09 00:20:58,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:58,398 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 587 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:58,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 945 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:20:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45544 states. [2025-01-09 00:20:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45544 to 45544. [2025-01-09 00:20:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45544 states, 45543 states have (on average 1.04694464571943) internal successors, (47681), 45543 states have internal predecessors, (47681), 0 states have call successors, (0), 0 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:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45544 states to 45544 states and 47681 transitions. [2025-01-09 00:20:58,775 INFO L78 Accepts]: Start accepts. Automaton has 45544 states and 47681 transitions. Word has length 1500 [2025-01-09 00:20:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:58,776 INFO L471 AbstractCegarLoop]: Abstraction has 45544 states and 47681 transitions. [2025-01-09 00:20:58,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.6666666666667) internal successors, (1094), 3 states have internal predecessors, (1094), 0 states have call successors, (0), 0 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:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45544 states and 47681 transitions. [2025-01-09 00:20:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1538 [2025-01-09 00:20:58,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:58,800 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:20:58,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:20:58,800 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:58,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1637862201, now seen corresponding path program 1 times [2025-01-09 00:20:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:58,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217842594] [2025-01-09 00:20:58,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:58,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1537 statements into 1 equivalence classes. [2025-01-09 00:20:58,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1537 of 1537 statements. [2025-01-09 00:20:58,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:58,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2151 backedges. 1609 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-01-09 00:21:00,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:00,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217842594] [2025-01-09 00:21:00,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217842594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:00,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:00,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:00,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905685656] [2025-01-09 00:21:00,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:00,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:21:00,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:00,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:21:00,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:21:00,234 INFO L87 Difference]: Start difference. First operand 45544 states and 47681 transitions. Second operand has 4 states, 4 states have (on average 255.75) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 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,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:02,490 INFO L93 Difference]: Finished difference Result 90396 states and 94669 transitions. [2025-01-09 00:21:02,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:21:02,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 255.75) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 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 1537 [2025-01-09 00:21:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:02,549 INFO L225 Difference]: With dead ends: 90396 [2025-01-09 00:21:02,549 INFO L226 Difference]: Without dead ends: 45544 [2025-01-09 00:21:02,569 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:02,570 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 990 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:02,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 67 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:21:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45544 states. [2025-01-09 00:21:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45544 to 45544. [2025-01-09 00:21:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45544 states, 45543 states have (on average 1.0467689875502273) internal successors, (47673), 45543 states have internal predecessors, (47673), 0 states have call successors, (0), 0 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,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45544 states to 45544 states and 47673 transitions. [2025-01-09 00:21:02,929 INFO L78 Accepts]: Start accepts. Automaton has 45544 states and 47673 transitions. Word has length 1537 [2025-01-09 00:21:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:02,930 INFO L471 AbstractCegarLoop]: Abstraction has 45544 states and 47673 transitions. [2025-01-09 00:21:02,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 255.75) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 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,930 INFO L276 IsEmpty]: Start isEmpty. Operand 45544 states and 47673 transitions. [2025-01-09 00:21:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1554 [2025-01-09 00:21:02,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:02,954 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:21:02,955 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:02,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:02,955 INFO L85 PathProgramCache]: Analyzing trace with hash 208941840, now seen corresponding path program 1 times [2025-01-09 00:21:02,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:02,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372271668] [2025-01-09 00:21:02,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:02,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:03,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1553 statements into 1 equivalence classes. [2025-01-09 00:21:03,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1553 of 1553 statements. [2025-01-09 00:21:03,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:03,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2029 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 1903 trivial. 0 not checked. [2025-01-09 00:21:03,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:03,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372271668] [2025-01-09 00:21:03,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372271668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:03,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:03,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:03,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820572111] [2025-01-09 00:21:03,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:03,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:03,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:03,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:03,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:03,666 INFO L87 Difference]: Start difference. First operand 45544 states and 47673 transitions. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:05,396 INFO L93 Difference]: Finished difference Result 90396 states and 94653 transitions. [2025-01-09 00:21:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:05,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1553 [2025-01-09 00:21:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:05,447 INFO L225 Difference]: With dead ends: 90396 [2025-01-09 00:21:05,448 INFO L226 Difference]: Without dead ends: 45544 [2025-01-09 00:21:05,472 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:05,473 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 669 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:05,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 947 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:21:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45544 states. [2025-01-09 00:21:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45544 to 44164. [2025-01-09 00:21:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44164 states, 44163 states have (on average 1.037905033625433) internal successors, (45837), 44163 states have internal predecessors, (45837), 0 states have call successors, (0), 0 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:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44164 states to 44164 states and 45837 transitions. [2025-01-09 00:21:05,971 INFO L78 Accepts]: Start accepts. Automaton has 44164 states and 45837 transitions. Word has length 1553 [2025-01-09 00:21:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:05,972 INFO L471 AbstractCegarLoop]: Abstraction has 44164 states and 45837 transitions. [2025-01-09 00:21:05,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 44164 states and 45837 transitions. [2025-01-09 00:21:06,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1583 [2025-01-09 00:21:06,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:06,019 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:21:06,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:21:06,019 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:06,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:06,020 INFO L85 PathProgramCache]: Analyzing trace with hash 395326000, now seen corresponding path program 1 times [2025-01-09 00:21:06,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:06,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376907757] [2025-01-09 00:21:06,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:06,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:06,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1582 statements into 1 equivalence classes. [2025-01-09 00:21:06,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1582 of 1582 statements. [2025-01-09 00:21:06,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:06,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 1877 proven. 0 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2025-01-09 00:21:06,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:06,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376907757] [2025-01-09 00:21:06,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376907757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:06,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:06,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:06,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039300973] [2025-01-09 00:21:06,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:06,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:06,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:06,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:06,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:06,845 INFO L87 Difference]: Start difference. First operand 44164 states and 45837 transitions. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 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,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:08,453 INFO L93 Difference]: Finished difference Result 108336 states and 112971 transitions. [2025-01-09 00:21:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:08,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 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 1582 [2025-01-09 00:21:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:08,521 INFO L225 Difference]: With dead ends: 108336 [2025-01-09 00:21:08,521 INFO L226 Difference]: Without dead ends: 64864 [2025-01-09 00:21:08,556 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:08,556 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 616 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:08,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 891 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:21:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64864 states. [2025-01-09 00:21:09,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64864 to 64174. [2025-01-09 00:21:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64174 states, 64173 states have (on average 1.0337213469839341) internal successors, (66337), 64173 states have internal predecessors, (66337), 0 states have call successors, (0), 0 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:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64174 states to 64174 states and 66337 transitions. [2025-01-09 00:21:09,214 INFO L78 Accepts]: Start accepts. Automaton has 64174 states and 66337 transitions. Word has length 1582 [2025-01-09 00:21:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:09,215 INFO L471 AbstractCegarLoop]: Abstraction has 64174 states and 66337 transitions. [2025-01-09 00:21:09,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 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:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 64174 states and 66337 transitions. [2025-01-09 00:21:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1643 [2025-01-09 00:21:09,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:09,255 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:09,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:21:09,256 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:09,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:09,257 INFO L85 PathProgramCache]: Analyzing trace with hash 730714618, now seen corresponding path program 1 times [2025-01-09 00:21:09,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:09,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639535383] [2025-01-09 00:21:09,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:09,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:09,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1642 statements into 1 equivalence classes. [2025-01-09 00:21:09,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1642 of 1642 statements. [2025-01-09 00:21:09,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:09,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 593 proven. 1591 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-01-09 00:21:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639535383] [2025-01-09 00:21:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639535383] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:21:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915942477] [2025-01-09 00:21:12,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:12,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:21:12,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:21:12,327 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:12,329 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:12,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1642 statements into 1 equivalence classes. [2025-01-09 00:21:12,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1642 of 1642 statements. [2025-01-09 00:21:12,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:12,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:12,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:21:12,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:21:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 1614 proven. 0 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2025-01-09 00:21:13,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:21:13,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915942477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:13,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:21:13,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 00:21:13,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904515269] [2025-01-09 00:21:13,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:13,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:13,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:13,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:13,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:21:13,091 INFO L87 Difference]: Start difference. First operand 64174 states and 66337 transitions. Second operand has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 0 states have call successors, (0), 0 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:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:14,709 INFO L93 Difference]: Finished difference Result 127656 states and 131981 transitions. [2025-01-09 00:21:14,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:14,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 0 states have call successors, (0), 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 1642 [2025-01-09 00:21:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:14,782 INFO L225 Difference]: With dead ends: 127656 [2025-01-09 00:21:14,782 INFO L226 Difference]: Without dead ends: 64174 [2025-01-09 00:21:14,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1650 GetRequests, 1642 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:21:14,819 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 589 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:14,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 970 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:21:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64174 states. [2025-01-09 00:21:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64174 to 64174. [2025-01-09 00:21:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64174 states, 64173 states have (on average 1.0334096894332507) internal successors, (66317), 64173 states have internal predecessors, (66317), 0 states have call successors, (0), 0 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,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64174 states to 64174 states and 66317 transitions. [2025-01-09 00:21:15,599 INFO L78 Accepts]: Start accepts. Automaton has 64174 states and 66317 transitions. Word has length 1642 [2025-01-09 00:21:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:15,600 INFO L471 AbstractCegarLoop]: Abstraction has 64174 states and 66317 transitions. [2025-01-09 00:21:15,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 0 states have call successors, (0), 0 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,600 INFO L276 IsEmpty]: Start isEmpty. Operand 64174 states and 66317 transitions. [2025-01-09 00:21:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1678 [2025-01-09 00:21:15,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:15,651 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,658 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:15,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 00:21:15,852 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:15,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:15,853 INFO L85 PathProgramCache]: Analyzing trace with hash 61003626, now seen corresponding path program 1 times [2025-01-09 00:21:15,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:15,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374209170] [2025-01-09 00:21:15,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:15,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:15,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1677 statements into 1 equivalence classes. [2025-01-09 00:21:16,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1677 of 1677 statements. [2025-01-09 00:21:16,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:16,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2933 backedges. 1966 proven. 0 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2025-01-09 00:21:17,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:17,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374209170] [2025-01-09 00:21:17,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374209170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:17,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:17,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:21:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524979254] [2025-01-09 00:21:17,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:17,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:17,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:17,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:17,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:17,089 INFO L87 Difference]: Start difference. First operand 64174 states and 66317 transitions. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 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:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:21:18,778 INFO L93 Difference]: Finished difference Result 146976 states and 152035 transitions. [2025-01-09 00:21:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:21:18,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 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 1677 [2025-01-09 00:21:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:21:18,850 INFO L225 Difference]: With dead ends: 146976 [2025-01-09 00:21:18,850 INFO L226 Difference]: Without dead ends: 83494 [2025-01-09 00:21:18,884 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:18,884 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 617 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:21:18,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 231 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:21:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83494 states. [2025-01-09 00:21:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83494 to 82804. [2025-01-09 00:21:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82804 states, 82803 states have (on average 1.0321969010784633) internal successors, (85469), 82803 states have internal predecessors, (85469), 0 states have call successors, (0), 0 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,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82804 states to 82804 states and 85469 transitions. [2025-01-09 00:21:19,515 INFO L78 Accepts]: Start accepts. Automaton has 82804 states and 85469 transitions. Word has length 1677 [2025-01-09 00:21:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:21:19,516 INFO L471 AbstractCegarLoop]: Abstraction has 82804 states and 85469 transitions. [2025-01-09 00:21:19,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 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,516 INFO L276 IsEmpty]: Start isEmpty. Operand 82804 states and 85469 transitions. [2025-01-09 00:21:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1772 [2025-01-09 00:21:19,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:19,546 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:21:19,547 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:19,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash 564558164, now seen corresponding path program 1 times [2025-01-09 00:21:19,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:19,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469650947] [2025-01-09 00:21:19,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:19,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:19,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1771 statements into 1 equivalence classes. [2025-01-09 00:21:19,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1771 of 1771 statements. [2025-01-09 00:21:19,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:19,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat