./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label41.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50ebe5851919469bd2115fd9df4bc67f7eb85dba2d380b6a5ab23ed124700184 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:05:54,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:05:54,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:05:54,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:05:54,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:05:54,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:05:54,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:05:54,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:05:54,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:05:54,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:05:54,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:05:54,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:05:54,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:05:54,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:05:54,341 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:05:54,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:05:54,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:05:54,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:05:54,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:05:54,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:05:54,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:05:54,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:05:54,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:05:54,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:05:54,343 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:05:54,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:05:54,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:05:54,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:05:54,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:05:54,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:05:54,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:05:54,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:05:54,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:05:54,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:05:54,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:05:54,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:05:54,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:05:54,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:05:54,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:05:54,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:05:54,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:05:54,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:05:54,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:05:54,344 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50ebe5851919469bd2115fd9df4bc67f7eb85dba2d380b6a5ab23ed124700184 [2025-03-08 02:05:54,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:05:54,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:05:54,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:05:54,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:05:54,561 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:05:54,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label41.c [2025-03-08 02:05:55,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dc96c5b/12433e13e24242d2b09a356068c4bcad/FLAG1ca1570e6 [2025-03-08 02:05:55,928 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:05:55,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label41.c [2025-03-08 02:05:55,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dc96c5b/12433e13e24242d2b09a356068c4bcad/FLAG1ca1570e6 [2025-03-08 02:05:56,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dc96c5b/12433e13e24242d2b09a356068c4bcad [2025-03-08 02:05:56,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:05:56,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:05:56,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:05:56,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:05:56,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:05:56,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d08bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56, skipping insertion in model container [2025-03-08 02:05:56,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:05:56,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label41.c[2609,2622] [2025-03-08 02:05:56,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:05:56,538 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:05:56,547 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label41.c[2609,2622] [2025-03-08 02:05:56,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:05:56,663 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:05:56,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56 WrapperNode [2025-03-08 02:05:56,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:05:56,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:05:56,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:05:56,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:05:56,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,784 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-08 02:05:56,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:05:56,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:05:56,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:05:56,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:05:56,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,858 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:05:56,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:05:56,928 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:05:56,929 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:05:56,929 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:05:56,930 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (1/1) ... [2025-03-08 02:05:56,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:05:56,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:56,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:05:56,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:05:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:05:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:05:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:05:56,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:05:57,025 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:05:57,026 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:05:58,520 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-08 02:05:58,574 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-08 02:05:58,574 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:05:58,591 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:05:58,591 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:05:58,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:58 BoogieIcfgContainer [2025-03-08 02:05:58,591 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:05:58,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:05:58,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:05:58,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:05:58,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:05:56" (1/3) ... [2025-03-08 02:05:58,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e65aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:58, skipping insertion in model container [2025-03-08 02:05:58,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:56" (2/3) ... [2025-03-08 02:05:58,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e65aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:58, skipping insertion in model container [2025-03-08 02:05:58,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:58" (3/3) ... [2025-03-08 02:05:58,602 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label41.c [2025-03-08 02:05:58,614 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:05:58,616 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label41.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:05:58,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:05:58,676 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;@4805c703, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:05:58,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:05:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:58,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 02:05:58,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:58,687 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] [2025-03-08 02:05:58,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:58,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1715150367, now seen corresponding path program 1 times [2025-03-08 02:05:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:58,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392517609] [2025-03-08 02:05:58,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:58,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:58,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 02:05:58,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 02:05:58,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:58,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:05:58,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:58,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392517609] [2025-03-08 02:05:58,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392517609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:58,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:58,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:05:58,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469043835] [2025-03-08 02:05:58,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:58,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:58,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:58,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:58,936 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:00,214 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-03-08 02:06:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-08 02:06:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:00,224 INFO L225 Difference]: With dead ends: 1122 [2025-03-08 02:06:00,224 INFO L226 Difference]: Without dead ends: 662 [2025-03-08 02:06:00,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:00,228 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 337 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:00,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:06:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-08 02:06:00,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-08 02:06:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2025-03-08 02:06:00,284 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 23 [2025-03-08 02:06:00,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:00,284 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2025-03-08 02:06:00,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:00,285 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2025-03-08 02:06:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 02:06:00,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:00,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:00,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:06:00,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:00,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:00,287 INFO L85 PathProgramCache]: Analyzing trace with hash -23561282, now seen corresponding path program 1 times [2025-03-08 02:06:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:00,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172409128] [2025-03-08 02:06:00,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:00,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:00,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 02:06:00,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 02:06:00,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:00,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:06:00,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:00,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172409128] [2025-03-08 02:06:00,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172409128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:00,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:00,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:00,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772066993] [2025-03-08 02:06:00,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:00,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:00,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:00,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:00,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:00,513 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:01,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:01,607 INFO L93 Difference]: Finished difference Result 1980 states and 3133 transitions. [2025-03-08 02:06:01,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:01,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-08 02:06:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:01,612 INFO L225 Difference]: With dead ends: 1980 [2025-03-08 02:06:01,612 INFO L226 Difference]: Without dead ends: 1320 [2025-03-08 02:06:01,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:01,613 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 277 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:01,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 79 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:06:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-08 02:06:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-08 02:06:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.5056861258529188) internal successors, (1986), 1319 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1986 transitions. [2025-03-08 02:06:01,642 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1986 transitions. Word has length 94 [2025-03-08 02:06:01,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:01,642 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1986 transitions. [2025-03-08 02:06:01,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1986 transitions. [2025-03-08 02:06:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 02:06:01,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:01,646 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:01,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:06:01,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:01,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:01,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1697331987, now seen corresponding path program 1 times [2025-03-08 02:06:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:01,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553698370] [2025-03-08 02:06:01,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:01,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:01,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 02:06:01,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 02:06:01,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:01,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 02:06:01,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553698370] [2025-03-08 02:06:01,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553698370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:01,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:01,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:01,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539333305] [2025-03-08 02:06:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:01,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:01,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:01,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:01,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:01,864 INFO L87 Difference]: Start difference. First operand 1320 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:02,860 INFO L93 Difference]: Finished difference Result 3954 states and 5953 transitions. [2025-03-08 02:06:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:02,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 165 [2025-03-08 02:06:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:02,868 INFO L225 Difference]: With dead ends: 3954 [2025-03-08 02:06:02,868 INFO L226 Difference]: Without dead ends: 2636 [2025-03-08 02:06:02,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:02,870 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 294 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:02,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 204 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:06:02,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-03-08 02:06:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-03-08 02:06:02,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.3240986717267553) internal successors, (3489), 2635 states have internal predecessors, (3489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3489 transitions. [2025-03-08 02:06:02,906 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3489 transitions. Word has length 165 [2025-03-08 02:06:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:02,907 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3489 transitions. [2025-03-08 02:06:02,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3489 transitions. [2025-03-08 02:06:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 02:06:02,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:02,917 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:02,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:06:02,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:02,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash 676904877, now seen corresponding path program 1 times [2025-03-08 02:06:02,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:02,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682314785] [2025-03-08 02:06:02,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:02,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:02,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 02:06:02,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 02:06:02,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:02,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 02:06:03,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:03,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682314785] [2025-03-08 02:06:03,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682314785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:03,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:03,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208774517] [2025-03-08 02:06:03,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:03,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:03,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:03,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:03,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:03,114 INFO L87 Difference]: Start difference. First operand 2636 states and 3489 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:04,162 INFO L93 Difference]: Finished difference Result 6586 states and 8894 transitions. [2025-03-08 02:06:04,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:04,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 189 [2025-03-08 02:06:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:04,171 INFO L225 Difference]: With dead ends: 6586 [2025-03-08 02:06:04,171 INFO L226 Difference]: Without dead ends: 3952 [2025-03-08 02:06:04,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:04,173 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:04,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:06:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-03-08 02:06:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3294. [2025-03-08 02:06:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.3054965077436989) internal successors, (4299), 3293 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4299 transitions. [2025-03-08 02:06:04,212 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4299 transitions. Word has length 189 [2025-03-08 02:06:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:04,212 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 4299 transitions. [2025-03-08 02:06:04,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4299 transitions. [2025-03-08 02:06:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-08 02:06:04,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:04,215 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:04,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:06:04,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:04,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1222364947, now seen corresponding path program 1 times [2025-03-08 02:06:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:04,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658189957] [2025-03-08 02:06:04,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:04,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:04,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-08 02:06:04,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-08 02:06:04,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:04,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 02:06:04,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:04,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658189957] [2025-03-08 02:06:04,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658189957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:04,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:04,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:04,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047471744] [2025-03-08 02:06:04,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:04,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:06:04,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:04,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:06:04,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:06:04,611 INFO L87 Difference]: Start difference. First operand 3294 states and 4299 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:05,636 INFO L93 Difference]: Finished difference Result 6915 states and 8943 transitions. [2025-03-08 02:06:05,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:06:05,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 281 [2025-03-08 02:06:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:05,643 INFO L225 Difference]: With dead ends: 6915 [2025-03-08 02:06:05,643 INFO L226 Difference]: Without dead ends: 3623 [2025-03-08 02:06:05,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:06:05,647 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 377 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:05,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 322 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:06:05,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-03-08 02:06:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3623. [2025-03-08 02:06:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 3622 states have (on average 1.2794036443953616) internal successors, (4634), 3622 states have internal predecessors, (4634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4634 transitions. [2025-03-08 02:06:05,700 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4634 transitions. Word has length 281 [2025-03-08 02:06:05,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:05,700 INFO L471 AbstractCegarLoop]: Abstraction has 3623 states and 4634 transitions. [2025-03-08 02:06:05,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4634 transitions. [2025-03-08 02:06:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-08 02:06:05,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:05,705 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:05,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:06:05,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:05,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:05,706 INFO L85 PathProgramCache]: Analyzing trace with hash 777083608, now seen corresponding path program 1 times [2025-03-08 02:06:05,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:05,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943944257] [2025-03-08 02:06:05,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:05,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:05,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-08 02:06:05,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-08 02:06:05,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:05,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 02:06:05,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:05,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943944257] [2025-03-08 02:06:05,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943944257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:05,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:05,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:05,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188531220] [2025-03-08 02:06:05,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:05,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:05,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:05,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:05,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:05,933 INFO L87 Difference]: Start difference. First operand 3623 states and 4634 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:06,909 INFO L93 Difference]: Finished difference Result 9547 states and 12419 transitions. [2025-03-08 02:06:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:06,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 368 [2025-03-08 02:06:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:06,919 INFO L225 Difference]: With dead ends: 9547 [2025-03-08 02:06:06,919 INFO L226 Difference]: Without dead ends: 4939 [2025-03-08 02:06:06,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:06,923 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 231 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:06,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 540 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:06:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-03-08 02:06:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2025-03-08 02:06:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.0814094775212637) internal successors, (5340), 4938 states have internal predecessors, (5340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5340 transitions. [2025-03-08 02:06:06,971 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5340 transitions. Word has length 368 [2025-03-08 02:06:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:06,971 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 5340 transitions. [2025-03-08 02:06:06,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5340 transitions. [2025-03-08 02:06:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2025-03-08 02:06:06,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:06,978 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:06,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:06:06,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:06,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1461643590, now seen corresponding path program 1 times [2025-03-08 02:06:06,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:06,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766341383] [2025-03-08 02:06:06,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:07,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-03-08 02:06:07,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-03-08 02:06:07,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:07,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 418 proven. 101 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-08 02:06:07,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:07,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766341383] [2025-03-08 02:06:07,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766341383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:07,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026932740] [2025-03-08 02:06:07,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:07,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:07,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:07,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:07,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:06:07,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-03-08 02:06:07,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-03-08 02:06:07,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:07,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:07,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:06:07,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 02:06:08,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:06:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026932740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:06:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 02:06:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073095861] [2025-03-08 02:06:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:08,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:08,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:08,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:08,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:06:08,212 INFO L87 Difference]: Start difference. First operand 4939 states and 5340 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 2 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:08,832 INFO L93 Difference]: Finished difference Result 10534 states and 11403 transitions. [2025-03-08 02:06:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:08,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 2 states have internal predecessors, (347), 0 states have call successors, (0), 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 554 [2025-03-08 02:06:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:08,844 INFO L225 Difference]: With dead ends: 10534 [2025-03-08 02:06:08,844 INFO L226 Difference]: Without dead ends: 5926 [2025-03-08 02:06:08,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:06:08,847 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:08,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 31 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2025-03-08 02:06:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2025-03-08 02:06:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5926 states, 5925 states have (on average 1.061434599156118) internal successors, (6289), 5925 states have internal predecessors, (6289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 6289 transitions. [2025-03-08 02:06:08,903 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 6289 transitions. Word has length 554 [2025-03-08 02:06:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:08,904 INFO L471 AbstractCegarLoop]: Abstraction has 5926 states and 6289 transitions. [2025-03-08 02:06:08,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 2 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 6289 transitions. [2025-03-08 02:06:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-03-08 02:06:08,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:08,915 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 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, 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] [2025-03-08 02:06:08,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:06:09,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:09,115 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:09,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash -523726160, now seen corresponding path program 1 times [2025-03-08 02:06:09,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:09,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575208309] [2025-03-08 02:06:09,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:09,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:09,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-03-08 02:06:09,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-03-08 02:06:09,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:09,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 754 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-03-08 02:06:09,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:09,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575208309] [2025-03-08 02:06:09,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575208309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:09,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:09,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:09,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242671353] [2025-03-08 02:06:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:09,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:06:09,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:09,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:06:09,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:06:09,738 INFO L87 Difference]: Start difference. First operand 5926 states and 6289 transitions. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:10,534 INFO L93 Difference]: Finished difference Result 11850 states and 12585 transitions. [2025-03-08 02:06:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:10,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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 679 [2025-03-08 02:06:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:10,548 INFO L225 Difference]: With dead ends: 11850 [2025-03-08 02:06:10,548 INFO L226 Difference]: Without dead ends: 6255 [2025-03-08 02:06:10,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:06:10,553 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 206 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:10,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 110 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:06:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2025-03-08 02:06:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255. [2025-03-08 02:06:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0588423409018228) internal successors, (6622), 6254 states have internal predecessors, (6622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6622 transitions. [2025-03-08 02:06:10,613 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6622 transitions. Word has length 679 [2025-03-08 02:06:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:10,614 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6622 transitions. [2025-03-08 02:06:10,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6622 transitions. [2025-03-08 02:06:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2025-03-08 02:06:10,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:10,622 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2025-03-08 02:06:10,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:06:10,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:10,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:10,623 INFO L85 PathProgramCache]: Analyzing trace with hash 588341443, now seen corresponding path program 1 times [2025-03-08 02:06:10,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:10,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006534717] [2025-03-08 02:06:10,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:10,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:10,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 783 statements into 1 equivalence classes. [2025-03-08 02:06:10,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 783 of 783 statements. [2025-03-08 02:06:10,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:10,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 1142 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-03-08 02:06:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006534717] [2025-03-08 02:06:11,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006534717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:11,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:11,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201829061] [2025-03-08 02:06:11,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:11,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:11,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:11,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:11,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:11,162 INFO L87 Difference]: Start difference. First operand 6255 states and 6622 transitions. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:11,784 INFO L93 Difference]: Finished difference Result 14811 states and 15807 transitions. [2025-03-08 02:06:11,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:11,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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 783 [2025-03-08 02:06:11,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:11,800 INFO L225 Difference]: With dead ends: 14811 [2025-03-08 02:06:11,801 INFO L226 Difference]: Without dead ends: 9216 [2025-03-08 02:06:11,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:11,806 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 223 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:11,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 36 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-03-08 02:06:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216. [2025-03-08 02:06:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0621812262615302) internal successors, (9788), 9215 states have internal predecessors, (9788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9788 transitions. [2025-03-08 02:06:11,890 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9788 transitions. Word has length 783 [2025-03-08 02:06:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:11,891 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9788 transitions. [2025-03-08 02:06:11,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9788 transitions. [2025-03-08 02:06:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2025-03-08 02:06:11,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:11,902 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:06:11,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:06:11,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:11,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:11,903 INFO L85 PathProgramCache]: Analyzing trace with hash 186395040, now seen corresponding path program 1 times [2025-03-08 02:06:11,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:11,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517478268] [2025-03-08 02:06:11,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:11,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1023 statements into 1 equivalence classes. [2025-03-08 02:06:11,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1023 of 1023 statements. [2025-03-08 02:06:11,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:11,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1777 backedges. 1297 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 02:06:12,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:12,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517478268] [2025-03-08 02:06:12,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517478268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:12,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:12,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:12,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643782790] [2025-03-08 02:06:12,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:12,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:12,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:12,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:12,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:12,348 INFO L87 Difference]: Start difference. First operand 9216 states and 9788 transitions. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:12,967 INFO L93 Difference]: Finished difference Result 20733 states and 22139 transitions. [2025-03-08 02:06:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:12,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 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 1023 [2025-03-08 02:06:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:12,985 INFO L225 Difference]: With dead ends: 20733 [2025-03-08 02:06:12,985 INFO L226 Difference]: Without dead ends: 12177 [2025-03-08 02:06:12,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:12,993 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:12,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 430 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2025-03-08 02:06:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 11519. [2025-03-08 02:06:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 11518 states have (on average 1.0537419690918561) internal successors, (12137), 11518 states have internal predecessors, (12137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12137 transitions. [2025-03-08 02:06:13,122 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 12137 transitions. Word has length 1023 [2025-03-08 02:06:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:13,122 INFO L471 AbstractCegarLoop]: Abstraction has 11519 states and 12137 transitions. [2025-03-08 02:06:13,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 12137 transitions. [2025-03-08 02:06:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1025 [2025-03-08 02:06:13,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:13,143 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:13,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:06:13,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:13,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1519951926, now seen corresponding path program 1 times [2025-03-08 02:06:13,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:13,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903347229] [2025-03-08 02:06:13,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:13,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:13,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1024 statements into 1 equivalence classes. [2025-03-08 02:06:13,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1024 of 1024 statements. [2025-03-08 02:06:13,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:13,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 1345 trivial. 0 not checked. [2025-03-08 02:06:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903347229] [2025-03-08 02:06:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903347229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:13,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:13,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:13,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516907120] [2025-03-08 02:06:13,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:13,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:13,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:13,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:13,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:13,568 INFO L87 Difference]: Start difference. First operand 11519 states and 12137 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:14,140 INFO L93 Difference]: Finished difference Result 25010 states and 26423 transitions. [2025-03-08 02:06:14,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:14,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1024 [2025-03-08 02:06:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:14,158 INFO L225 Difference]: With dead ends: 25010 [2025-03-08 02:06:14,158 INFO L226 Difference]: Without dead ends: 12506 [2025-03-08 02:06:14,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:14,197 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 273 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:14,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 412 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-03-08 02:06:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 10861. [2025-03-08 02:06:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.043830570902394) internal successors, (11336), 10860 states have internal predecessors, (11336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11336 transitions. [2025-03-08 02:06:14,281 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11336 transitions. Word has length 1024 [2025-03-08 02:06:14,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:14,282 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11336 transitions. [2025-03-08 02:06:14,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11336 transitions. [2025-03-08 02:06:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2025-03-08 02:06:14,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:14,293 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:06:14,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:06:14,294 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:14,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1806361862, now seen corresponding path program 1 times [2025-03-08 02:06:14,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:14,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813730182] [2025-03-08 02:06:14,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:14,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1143 statements into 1 equivalence classes. [2025-03-08 02:06:14,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1143 of 1143 statements. [2025-03-08 02:06:14,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:14,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2589 backedges. 1781 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-08 02:06:15,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:15,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813730182] [2025-03-08 02:06:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813730182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:15,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:15,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680193890] [2025-03-08 02:06:15,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:15,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:15,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:15,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:15,205 INFO L87 Difference]: Start difference. First operand 10861 states and 11336 transitions. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:15,739 INFO L93 Difference]: Finished difference Result 22707 states and 23728 transitions. [2025-03-08 02:06:15,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:15,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 1143 [2025-03-08 02:06:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:15,758 INFO L225 Difference]: With dead ends: 22707 [2025-03-08 02:06:15,758 INFO L226 Difference]: Without dead ends: 12506 [2025-03-08 02:06:15,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:15,767 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 204 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:15,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 47 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-03-08 02:06:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12506. [2025-03-08 02:06:15,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0408636545381846) internal successors, (13016), 12505 states have internal predecessors, (13016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 13016 transitions. [2025-03-08 02:06:15,870 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 13016 transitions. Word has length 1143 [2025-03-08 02:06:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:15,872 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 13016 transitions. [2025-03-08 02:06:15,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 13016 transitions. [2025-03-08 02:06:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1169 [2025-03-08 02:06:15,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:15,911 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:15,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:06:15,911 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:15,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:15,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1512885090, now seen corresponding path program 1 times [2025-03-08 02:06:15,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:15,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018720671] [2025-03-08 02:06:15,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:15,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:15,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1168 statements into 1 equivalence classes. [2025-03-08 02:06:16,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1168 of 1168 statements. [2025-03-08 02:06:16,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:16,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 1577 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2025-03-08 02:06:16,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:16,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018720671] [2025-03-08 02:06:16,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018720671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:16,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:16,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:06:16,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117820935] [2025-03-08 02:06:16,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:16,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 02:06:16,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:16,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 02:06:16,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:06:16,832 INFO L87 Difference]: Start difference. First operand 12506 states and 13016 transitions. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:17,591 INFO L93 Difference]: Finished difference Result 24353 states and 25367 transitions. [2025-03-08 02:06:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 02:06:17,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 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 1168 [2025-03-08 02:06:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:17,607 INFO L225 Difference]: With dead ends: 24353 [2025-03-08 02:06:17,608 INFO L226 Difference]: Without dead ends: 12507 [2025-03-08 02:06:17,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:06:17,617 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 299 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:17,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 434 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:06:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12507 states. [2025-03-08 02:06:17,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12507 to 12506. [2025-03-08 02:06:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0397441023590563) internal successors, (13002), 12505 states have internal predecessors, (13002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 13002 transitions. [2025-03-08 02:06:17,711 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 13002 transitions. Word has length 1168 [2025-03-08 02:06:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:17,711 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 13002 transitions. [2025-03-08 02:06:17,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 13002 transitions. [2025-03-08 02:06:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1173 [2025-03-08 02:06:17,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:17,725 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:17,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:06:17,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:17,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1224891634, now seen corresponding path program 1 times [2025-03-08 02:06:17,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:17,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537485135] [2025-03-08 02:06:17,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:17,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:17,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1172 statements into 1 equivalence classes. [2025-03-08 02:06:17,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1172 of 1172 statements. [2025-03-08 02:06:17,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:17,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2703 backedges. 1917 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-08 02:06:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537485135] [2025-03-08 02:06:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537485135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:18,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:18,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061219647] [2025-03-08 02:06:18,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:18,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:18,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:18,268 INFO L87 Difference]: Start difference. First operand 12506 states and 13002 transitions. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:18,854 INFO L93 Difference]: Finished difference Result 24352 states and 25338 transitions. [2025-03-08 02:06:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:18,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 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 1172 [2025-03-08 02:06:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:18,872 INFO L225 Difference]: With dead ends: 24352 [2025-03-08 02:06:18,872 INFO L226 Difference]: Without dead ends: 12506 [2025-03-08 02:06:18,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:18,880 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:18,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 420 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-03-08 02:06:18,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12177. [2025-03-08 02:06:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0338370565045991) internal successors, (12588), 12176 states have internal predecessors, (12588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12588 transitions. [2025-03-08 02:06:19,003 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12588 transitions. Word has length 1172 [2025-03-08 02:06:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:19,004 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12588 transitions. [2025-03-08 02:06:19,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12588 transitions. [2025-03-08 02:06:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1183 [2025-03-08 02:06:19,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:19,017 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:19,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:06:19,017 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:19,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash 77655956, now seen corresponding path program 1 times [2025-03-08 02:06:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:19,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457151314] [2025-03-08 02:06:19,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:19,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1182 statements into 1 equivalence classes. [2025-03-08 02:06:19,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1182 of 1182 statements. [2025-03-08 02:06:19,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:19,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2228 backedges. 1584 proven. 0 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2025-03-08 02:06:19,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:19,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457151314] [2025-03-08 02:06:19,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457151314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:19,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:19,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:06:19,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575044844] [2025-03-08 02:06:19,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:19,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:06:19,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:19,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:06:19,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:06:19,976 INFO L87 Difference]: Start difference. First operand 12177 states and 12588 transitions. Second operand has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:20,726 INFO L93 Difference]: Finished difference Result 23704 states and 24520 transitions. [2025-03-08 02:06:20,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:06:20,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 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 1182 [2025-03-08 02:06:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:20,740 INFO L225 Difference]: With dead ends: 23704 [2025-03-08 02:06:20,740 INFO L226 Difference]: Without dead ends: 12187 [2025-03-08 02:06:20,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:06:20,748 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:20,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 436 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:06:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12187 states. [2025-03-08 02:06:20,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12187 to 12177. [2025-03-08 02:06:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0336727989487517) internal successors, (12586), 12176 states have internal predecessors, (12586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12586 transitions. [2025-03-08 02:06:20,833 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12586 transitions. Word has length 1182 [2025-03-08 02:06:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:20,834 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12586 transitions. [2025-03-08 02:06:20,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12586 transitions. [2025-03-08 02:06:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1198 [2025-03-08 02:06:20,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:20,847 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:20,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:06:20,847 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:20,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash 977771767, now seen corresponding path program 1 times [2025-03-08 02:06:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:20,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378779568] [2025-03-08 02:06:20,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:20,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1197 statements into 1 equivalence classes. [2025-03-08 02:06:20,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1197 of 1197 statements. [2025-03-08 02:06:20,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:20,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2853 backedges. 1535 proven. 0 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2025-03-08 02:06:21,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378779568] [2025-03-08 02:06:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378779568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:21,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:21,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564719406] [2025-03-08 02:06:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:21,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:21,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:21,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:21,594 INFO L87 Difference]: Start difference. First operand 12177 states and 12586 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:22,143 INFO L93 Difference]: Finished difference Result 24352 states and 25175 transitions. [2025-03-08 02:06:22,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:22,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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 1197 [2025-03-08 02:06:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:22,154 INFO L225 Difference]: With dead ends: 24352 [2025-03-08 02:06:22,155 INFO L226 Difference]: Without dead ends: 12835 [2025-03-08 02:06:22,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:22,162 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:22,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 430 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2025-03-08 02:06:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12835. [2025-03-08 02:06:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0323359825463612) internal successors, (13249), 12834 states have internal predecessors, (13249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13249 transitions. [2025-03-08 02:06:22,250 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13249 transitions. Word has length 1197 [2025-03-08 02:06:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:22,251 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13249 transitions. [2025-03-08 02:06:22,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13249 transitions. [2025-03-08 02:06:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2025-03-08 02:06:22,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:22,263 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:22,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:06:22,264 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:22,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:22,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1966409407, now seen corresponding path program 1 times [2025-03-08 02:06:22,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480786193] [2025-03-08 02:06:22,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:22,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:22,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1222 statements into 1 equivalence classes. [2025-03-08 02:06:22,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1222 of 1222 statements. [2025-03-08 02:06:22,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:22,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2499 backedges. 1685 proven. 0 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2025-03-08 02:06:23,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:23,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480786193] [2025-03-08 02:06:23,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480786193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:23,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:23,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:06:23,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16342447] [2025-03-08 02:06:23,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:23,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:06:23,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:23,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:06:23,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:06:23,283 INFO L87 Difference]: Start difference. First operand 12835 states and 13249 transitions. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:23,972 INFO L93 Difference]: Finished difference Result 25010 states and 25832 transitions. [2025-03-08 02:06:23,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:06:23,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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 1222 [2025-03-08 02:06:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:23,983 INFO L225 Difference]: With dead ends: 25010 [2025-03-08 02:06:23,983 INFO L226 Difference]: Without dead ends: 12835 [2025-03-08 02:06:23,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:06:23,989 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:23,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 553 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2025-03-08 02:06:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12835. [2025-03-08 02:06:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0314009661835748) internal successors, (13237), 12834 states have internal predecessors, (13237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13237 transitions. [2025-03-08 02:06:24,080 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13237 transitions. Word has length 1222 [2025-03-08 02:06:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:24,080 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13237 transitions. [2025-03-08 02:06:24,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13237 transitions. [2025-03-08 02:06:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1252 [2025-03-08 02:06:24,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:24,092 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:24,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:06:24,093 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:24,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1519851180, now seen corresponding path program 1 times [2025-03-08 02:06:24,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:24,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611501280] [2025-03-08 02:06:24,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:24,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1251 statements into 1 equivalence classes. [2025-03-08 02:06:24,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1251 of 1251 statements. [2025-03-08 02:06:24,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:24,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2874 backedges. 1151 proven. 994 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-03-08 02:06:25,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:25,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611501280] [2025-03-08 02:06:25,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611501280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:25,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124869797] [2025-03-08 02:06:25,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:25,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:25,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:25,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:25,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:06:25,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1251 statements into 1 equivalence classes. [2025-03-08 02:06:25,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1251 of 1251 statements. [2025-03-08 02:06:25,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:25,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:25,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:06:25,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2874 backedges. 1728 proven. 0 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2025-03-08 02:06:25,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:06:25,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124869797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:25,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:06:25,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 02:06:25,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957704879] [2025-03-08 02:06:25,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:25,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:25,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:25,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:25,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:06:25,802 INFO L87 Difference]: Start difference. First operand 12835 states and 13237 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:26,308 INFO L93 Difference]: Finished difference Result 25010 states and 25808 transitions. [2025-03-08 02:06:26,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:26,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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 1251 [2025-03-08 02:06:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:26,318 INFO L225 Difference]: With dead ends: 25010 [2025-03-08 02:06:26,318 INFO L226 Difference]: Without dead ends: 12835 [2025-03-08 02:06:26,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1255 GetRequests, 1251 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:06:26,325 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 116 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:26,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 377 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:26,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2025-03-08 02:06:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12835. [2025-03-08 02:06:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0291413433068413) internal successors, (13208), 12834 states have internal predecessors, (13208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13208 transitions. [2025-03-08 02:06:26,419 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13208 transitions. Word has length 1251 [2025-03-08 02:06:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:26,419 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13208 transitions. [2025-03-08 02:06:26,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13208 transitions. [2025-03-08 02:06:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1320 [2025-03-08 02:06:26,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:26,432 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:26,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 02:06:26,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 02:06:26,632 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:26,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:26,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1479537569, now seen corresponding path program 1 times [2025-03-08 02:06:26,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:26,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778619513] [2025-03-08 02:06:26,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:26,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1319 statements into 1 equivalence classes. [2025-03-08 02:06:26,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1319 of 1319 statements. [2025-03-08 02:06:26,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:26,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3368 backedges. 640 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-08 02:06:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778619513] [2025-03-08 02:06:27,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778619513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:27,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:27,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:27,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326722794] [2025-03-08 02:06:27,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:27,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:27,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:27,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:27,599 INFO L87 Difference]: Start difference. First operand 12835 states and 13208 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:28,104 INFO L93 Difference]: Finished difference Result 25339 states and 26083 transitions. [2025-03-08 02:06:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:28,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1319 [2025-03-08 02:06:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:28,114 INFO L225 Difference]: With dead ends: 25339 [2025-03-08 02:06:28,114 INFO L226 Difference]: Without dead ends: 12835 [2025-03-08 02:06:28,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:28,121 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 269 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:28,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 370 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2025-03-08 02:06:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12506. [2025-03-08 02:06:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0236705317872852) internal successors, (12801), 12505 states have internal predecessors, (12801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12801 transitions. [2025-03-08 02:06:28,195 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12801 transitions. Word has length 1319 [2025-03-08 02:06:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:28,196 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12801 transitions. [2025-03-08 02:06:28,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12801 transitions. [2025-03-08 02:06:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1604 [2025-03-08 02:06:28,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:28,212 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2025-03-08 02:06:28,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:06:28,212 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:28,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:28,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1089619137, now seen corresponding path program 1 times [2025-03-08 02:06:28,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:28,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789648258] [2025-03-08 02:06:28,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:28,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:28,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1603 statements into 1 equivalence classes. [2025-03-08 02:06:28,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1603 of 1603 statements. [2025-03-08 02:06:28,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:28,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4420 backedges. 3056 proven. 202 refuted. 0 times theorem prover too weak. 1162 trivial. 0 not checked. [2025-03-08 02:06:29,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:29,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789648258] [2025-03-08 02:06:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789648258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:29,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595130436] [2025-03-08 02:06:29,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:29,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:29,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:29,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:29,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:06:29,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1603 statements into 1 equivalence classes. [2025-03-08 02:06:29,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1603 of 1603 statements. [2025-03-08 02:06:29,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:29,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:29,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1833 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:06:29,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4420 backedges. 2129 proven. 201 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2025-03-08 02:06:31,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:06:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4420 backedges. 2129 proven. 201 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2025-03-08 02:06:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595130436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:06:34,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:06:34,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-08 02:06:34,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676145395] [2025-03-08 02:06:34,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:06:34,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 02:06:34,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:34,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 02:06:34,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:06:34,290 INFO L87 Difference]: Start difference. First operand 12506 states and 12801 transitions. Second operand has 10 states, 10 states have (on average 174.6) internal successors, (1746), 9 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:37,350 INFO L93 Difference]: Finished difference Result 25010 states and 25605 transitions. [2025-03-08 02:06:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 02:06:37,351 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 174.6) internal successors, (1746), 9 states have internal predecessors, (1746), 0 states have call successors, (0), 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 1603 [2025-03-08 02:06:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:37,361 INFO L225 Difference]: With dead ends: 25010 [2025-03-08 02:06:37,361 INFO L226 Difference]: Without dead ends: 13164 [2025-03-08 02:06:37,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3215 GetRequests, 3201 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-08 02:06:37,367 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1399 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7421 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 7564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 7421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:37,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 92 Invalid, 7564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 7421 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 02:06:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-03-08 02:06:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2025-03-08 02:06:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0197523360935956) internal successors, (13423), 13163 states have internal predecessors, (13423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13423 transitions. [2025-03-08 02:06:37,458 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13423 transitions. Word has length 1603 [2025-03-08 02:06:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:37,458 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13423 transitions. [2025-03-08 02:06:37,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 174.6) internal successors, (1746), 9 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13423 transitions. [2025-03-08 02:06:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1722 [2025-03-08 02:06:37,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:37,476 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:06:37,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 02:06:37,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:37,677 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:37,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:37,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1841636300, now seen corresponding path program 1 times [2025-03-08 02:06:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:37,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233519048] [2025-03-08 02:06:37,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:37,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:37,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1721 statements into 1 equivalence classes. [2025-03-08 02:06:37,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1721 of 1721 statements. [2025-03-08 02:06:37,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:37,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5423 backedges. 3158 proven. 1556 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2025-03-08 02:06:40,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233519048] [2025-03-08 02:06:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233519048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881690209] [2025-03-08 02:06:40,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:40,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:40,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:40,508 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:40,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:06:40,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1721 statements into 1 equivalence classes. [2025-03-08 02:06:40,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1721 of 1721 statements. [2025-03-08 02:06:40,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:40,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:40,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:06:40,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5423 backedges. 3611 proven. 0 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2025-03-08 02:06:41,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:06:41,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881690209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:41,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:06:41,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-08 02:06:41,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544569344] [2025-03-08 02:06:41,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:41,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:41,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:41,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:41,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:06:41,098 INFO L87 Difference]: Start difference. First operand 13164 states and 13423 transitions. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:41,599 INFO L93 Difference]: Finished difference Result 25668 states and 26182 transitions. [2025-03-08 02:06:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:41,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 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 1721 [2025-03-08 02:06:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:41,608 INFO L225 Difference]: With dead ends: 25668 [2025-03-08 02:06:41,608 INFO L226 Difference]: Without dead ends: 13164 [2025-03-08 02:06:41,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1729 GetRequests, 1722 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:06:41,614 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 65 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:41,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 410 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-03-08 02:06:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2025-03-08 02:06:41,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0167894856795563) internal successors, (13384), 13163 states have internal predecessors, (13384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13384 transitions. [2025-03-08 02:06:41,718 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13384 transitions. Word has length 1721 [2025-03-08 02:06:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:41,718 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13384 transitions. [2025-03-08 02:06:41,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13384 transitions. [2025-03-08 02:06:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1873 [2025-03-08 02:06:41,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:41,740 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:41,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 02:06:41,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:41,940 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:41,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash -662046742, now seen corresponding path program 1 times [2025-03-08 02:06:41,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:41,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022448098] [2025-03-08 02:06:41,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:42,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1872 statements into 1 equivalence classes. [2025-03-08 02:06:42,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1872 of 1872 statements. [2025-03-08 02:06:42,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:42,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7485 backedges. 3697 proven. 0 refuted. 0 times theorem prover too weak. 3788 trivial. 0 not checked. [2025-03-08 02:06:43,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:43,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022448098] [2025-03-08 02:06:43,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022448098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:43,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:43,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:43,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720100993] [2025-03-08 02:06:43,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:43,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:43,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:43,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:43,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:43,466 INFO L87 Difference]: Start difference. First operand 13164 states and 13384 transitions. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:44,064 INFO L93 Difference]: Finished difference Result 29287 states and 29792 transitions. [2025-03-08 02:06:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:44,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1872 [2025-03-08 02:06:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:44,081 INFO L225 Difference]: With dead ends: 29287 [2025-03-08 02:06:44,081 INFO L226 Difference]: Without dead ends: 16783 [2025-03-08 02:06:44,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:44,091 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 209 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:44,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 44 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2025-03-08 02:06:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 14151. [2025-03-08 02:06:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.017809187279152) internal successors, (14402), 14150 states have internal predecessors, (14402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14402 transitions. [2025-03-08 02:06:44,246 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14402 transitions. Word has length 1872 [2025-03-08 02:06:44,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:44,247 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14402 transitions. [2025-03-08 02:06:44,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14402 transitions. [2025-03-08 02:06:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1914 [2025-03-08 02:06:44,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:44,286 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:44,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:06:44,286 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:44,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:44,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1656851087, now seen corresponding path program 1 times [2025-03-08 02:06:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:44,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556653507] [2025-03-08 02:06:44,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:44,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:44,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1913 statements into 1 equivalence classes. [2025-03-08 02:06:44,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1913 of 1913 statements. [2025-03-08 02:06:44,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:44,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8303 backedges. 5479 proven. 79 refuted. 0 times theorem prover too weak. 2745 trivial. 0 not checked. [2025-03-08 02:06:46,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:46,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556653507] [2025-03-08 02:06:46,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556653507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:46,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968994575] [2025-03-08 02:06:46,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:46,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:46,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:46,646 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:46,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 02:06:46,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1913 statements into 1 equivalence classes. [2025-03-08 02:06:47,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1913 of 1913 statements. [2025-03-08 02:06:47,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:47,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:47,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 2238 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:06:47,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8303 backedges. 4718 proven. 0 refuted. 0 times theorem prover too weak. 3585 trivial. 0 not checked. [2025-03-08 02:06:47,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:06:47,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968994575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:47,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:06:47,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 02:06:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474056743] [2025-03-08 02:06:47,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:47,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:47,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:47,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:06:47,492 INFO L87 Difference]: Start difference. First operand 14151 states and 14402 transitions. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:47,992 INFO L93 Difference]: Finished difference Result 27642 states and 28140 transitions. [2025-03-08 02:06:47,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:47,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 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 1913 [2025-03-08 02:06:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:48,004 INFO L225 Difference]: With dead ends: 27642 [2025-03-08 02:06:48,004 INFO L226 Difference]: Without dead ends: 14151 [2025-03-08 02:06:48,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1916 GetRequests, 1913 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:06:48,012 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:48,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 424 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 02:06:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-08 02:06:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 14151. [2025-03-08 02:06:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0175265017667845) internal successors, (14398), 14150 states have internal predecessors, (14398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:48,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14398 transitions. [2025-03-08 02:06:48,130 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14398 transitions. Word has length 1913 [2025-03-08 02:06:48,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:48,131 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14398 transitions. [2025-03-08 02:06:48,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14398 transitions. [2025-03-08 02:06:48,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1935 [2025-03-08 02:06:48,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:48,150 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:48,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 02:06:48,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 02:06:48,351 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:48,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:48,351 INFO L85 PathProgramCache]: Analyzing trace with hash -543230790, now seen corresponding path program 1 times [2025-03-08 02:06:48,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:48,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050358857] [2025-03-08 02:06:48,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:48,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:48,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1934 statements into 1 equivalence classes. [2025-03-08 02:06:48,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1934 of 1934 statements. [2025-03-08 02:06:48,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:48,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8000 backedges. 5946 proven. 91 refuted. 0 times theorem prover too weak. 1963 trivial. 0 not checked. [2025-03-08 02:06:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050358857] [2025-03-08 02:06:50,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050358857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966599024] [2025-03-08 02:06:50,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:50,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:50,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:50,182 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:06:50,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 02:06:50,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1934 statements into 1 equivalence classes. [2025-03-08 02:06:50,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1934 of 1934 statements. [2025-03-08 02:06:50,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:50,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:50,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 2253 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:06:50,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8000 backedges. 5052 proven. 67 refuted. 0 times theorem prover too weak. 2881 trivial. 0 not checked. [2025-03-08 02:06:55,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:06:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8000 backedges. 4044 proven. 0 refuted. 0 times theorem prover too weak. 3956 trivial. 0 not checked. [2025-03-08 02:06:57,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966599024] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:57,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:06:57,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-03-08 02:06:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753349581] [2025-03-08 02:06:57,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:57,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:57,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:57,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:06:57,258 INFO L87 Difference]: Start difference. First operand 14151 states and 14398 transitions. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:57,882 INFO L93 Difference]: Finished difference Result 29616 states and 30138 transitions. [2025-03-08 02:06:57,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:57,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1934 [2025-03-08 02:06:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:57,897 INFO L225 Difference]: With dead ends: 29616 [2025-03-08 02:06:57,897 INFO L226 Difference]: Without dead ends: 16125 [2025-03-08 02:06:57,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3872 GetRequests, 3865 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:06:57,906 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 269 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:57,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 39 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2025-03-08 02:06:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 15138. [2025-03-08 02:06:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.0167140120235185) internal successors, (15390), 15137 states have internal predecessors, (15390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15390 transitions. [2025-03-08 02:06:58,012 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15390 transitions. Word has length 1934 [2025-03-08 02:06:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:58,013 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 15390 transitions. [2025-03-08 02:06:58,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15390 transitions. [2025-03-08 02:06:58,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1985 [2025-03-08 02:06:58,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:58,035 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:58,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 02:06:58,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:58,236 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:58,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1023972554, now seen corresponding path program 1 times [2025-03-08 02:06:58,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:58,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186673705] [2025-03-08 02:06:58,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:58,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1984 statements into 1 equivalence classes. [2025-03-08 02:06:58,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1984 of 1984 statements. [2025-03-08 02:06:58,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:58,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8374 backedges. 5511 proven. 79 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2025-03-08 02:07:00,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:00,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186673705] [2025-03-08 02:07:00,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186673705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:00,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269805208] [2025-03-08 02:07:00,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:00,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:00,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:00,441 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:07:00,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 02:07:00,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1984 statements into 1 equivalence classes. [2025-03-08 02:07:00,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1984 of 1984 statements. [2025-03-08 02:07:00,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:00,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:00,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 2305 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:07:00,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8374 backedges. 4809 proven. 250 refuted. 0 times theorem prover too weak. 3315 trivial. 0 not checked. [2025-03-08 02:07:01,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:07:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8374 backedges. 3878 proven. 0 refuted. 0 times theorem prover too weak. 4496 trivial. 0 not checked. [2025-03-08 02:07:02,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269805208] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:02,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:07:02,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-08 02:07:02,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583556708] [2025-03-08 02:07:02,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:02,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:02,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:02,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:02,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:07:02,523 INFO L87 Difference]: Start difference. First operand 15138 states and 15390 transitions. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:03,096 INFO L93 Difference]: Finished difference Result 30603 states and 31111 transitions. [2025-03-08 02:07:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:03,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1984 [2025-03-08 02:07:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:03,110 INFO L225 Difference]: With dead ends: 30603 [2025-03-08 02:07:03,110 INFO L226 Difference]: Without dead ends: 15796 [2025-03-08 02:07:03,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3970 GetRequests, 3965 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:07:03,117 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:03,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 16 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2025-03-08 02:07:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 15467. [2025-03-08 02:07:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0161644898487003) internal successors, (15716), 15466 states have internal predecessors, (15716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 15716 transitions. [2025-03-08 02:07:03,225 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 15716 transitions. Word has length 1984 [2025-03-08 02:07:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:03,226 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 15716 transitions. [2025-03-08 02:07:03,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 15716 transitions. [2025-03-08 02:07:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2052 [2025-03-08 02:07:03,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:03,249 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:03,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 02:07:03,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:03,449 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:03,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:03,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1372084887, now seen corresponding path program 1 times [2025-03-08 02:07:03,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:03,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173008081] [2025-03-08 02:07:03,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:03,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:03,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2051 statements into 1 equivalence classes. [2025-03-08 02:07:03,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2051 of 2051 statements. [2025-03-08 02:07:03,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:03,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9198 backedges. 5912 proven. 79 refuted. 0 times theorem prover too weak. 3207 trivial. 0 not checked. [2025-03-08 02:07:05,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:05,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173008081] [2025-03-08 02:07:05,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173008081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:05,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637446917] [2025-03-08 02:07:05,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:05,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:05,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:05,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:07:05,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 02:07:05,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2051 statements into 1 equivalence classes. [2025-03-08 02:07:06,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2051 of 2051 statements. [2025-03-08 02:07:06,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:06,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:06,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 2392 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:07:06,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9198 backedges. 5391 proven. 0 refuted. 0 times theorem prover too weak. 3807 trivial. 0 not checked. [2025-03-08 02:07:06,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:07:06,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637446917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:06,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:07:06,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 02:07:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92404952] [2025-03-08 02:07:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:06,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:06,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:06,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:06,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:07:06,716 INFO L87 Difference]: Start difference. First operand 15467 states and 15716 transitions. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:07,261 INFO L93 Difference]: Finished difference Result 31590 states and 32115 transitions. [2025-03-08 02:07:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:07,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 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 2051 [2025-03-08 02:07:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:07,276 INFO L225 Difference]: With dead ends: 31590 [2025-03-08 02:07:07,276 INFO L226 Difference]: Without dead ends: 16454 [2025-03-08 02:07:07,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2054 GetRequests, 2051 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:07:07,284 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 52 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:07,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 94 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-08 02:07:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 15467. [2025-03-08 02:07:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0160351739299107) internal successors, (15714), 15466 states have internal predecessors, (15714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 15714 transitions. [2025-03-08 02:07:07,401 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 15714 transitions. Word has length 2051 [2025-03-08 02:07:07,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:07,402 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 15714 transitions. [2025-03-08 02:07:07,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 15714 transitions. [2025-03-08 02:07:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2215 [2025-03-08 02:07:07,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:07,427 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:07,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 02:07:07,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 02:07:07,628 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:07,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1523859519, now seen corresponding path program 1 times [2025-03-08 02:07:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:07,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852728470] [2025-03-08 02:07:07,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:07,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2214 statements into 1 equivalence classes. [2025-03-08 02:07:07,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2214 of 2214 statements. [2025-03-08 02:07:07,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:07,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9931 backedges. 7290 proven. 91 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2025-03-08 02:07:09,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:09,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852728470] [2025-03-08 02:07:09,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852728470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102467224] [2025-03-08 02:07:09,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:09,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:09,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:09,774 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:07:09,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 02:07:09,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2214 statements into 1 equivalence classes. [2025-03-08 02:07:10,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2214 of 2214 statements. [2025-03-08 02:07:10,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:10,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:10,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 2553 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:07:10,150 INFO L279 TraceCheckSpWp]: Computing forward predicates...