./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label59.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 685efd9995e3559fa33c98b3c3a918c092f08496a4c3c16e54af7b7a4363265b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:05:02,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:05:02,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:05:02,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:05:02,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:05:02,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:05:02,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:05:02,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:05:02,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:05:02,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:05:02,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:05:02,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:05:02,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:05:02,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:05:02,868 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:05:02,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:05:02,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:05:02,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:05:02,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:05:02,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:05:02,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:05:02,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:05:02,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:05:02,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:05:02,869 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:05:02,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:05:02,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:05:02,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:05:02,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:05:02,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:05:02,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:05:02,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:05:02,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:05:02,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:05:02,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:05:02,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:05:02,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:05:02,871 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 685efd9995e3559fa33c98b3c3a918c092f08496a4c3c16e54af7b7a4363265b [2025-01-09 00:05:03,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:05:03,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:05:03,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:05:03,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:05:03,202 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:05:03,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label59.c [2025-01-09 00:05:04,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c001b35/935bb116e29c46f0a071940fe3b8dc2e/FLAG4067a9e02 [2025-01-09 00:05:04,872 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:05:04,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label59.c [2025-01-09 00:05:04,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c001b35/935bb116e29c46f0a071940fe3b8dc2e/FLAG4067a9e02 [2025-01-09 00:05:04,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c001b35/935bb116e29c46f0a071940fe3b8dc2e [2025-01-09 00:05:04,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:05:04,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:05:04,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:05:04,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:05:04,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:05:04,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:05:04" (1/1) ... [2025-01-09 00:05:04,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f1b6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:04, skipping insertion in model container [2025-01-09 00:05:04,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:05:04" (1/1) ... [2025-01-09 00:05:04,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:05:05,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label59.c[6635,6648] [2025-01-09 00:05:05,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:05:05,450 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:05:05,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label59.c[6635,6648] [2025-01-09 00:05:05,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:05:05,621 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:05:05,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05 WrapperNode [2025-01-09 00:05:05,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:05:05,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:05:05,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:05:05,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:05:05,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:05,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:05,846 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:05:05,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:05:05,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:05:05,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:05:05,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:05:05,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:05,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:05,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:06,008 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:05:06,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:06,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:06,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:06,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:06,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:06,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:06,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:06,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:05:06,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:05:06,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:05:06,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:05:06,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (1/1) ... [2025-01-09 00:05:06,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:05:06,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:05:06,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:05:06,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:05:06,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:05:06,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:05:06,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:05:06,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:05:06,286 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:05:06,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:05:08,691 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:05:08,692 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:05:08,713 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:05:08,713 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:05:08,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:05:08 BoogieIcfgContainer [2025-01-09 00:05:08,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:05:08,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:05:08,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:05:08,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:05:08,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:05:04" (1/3) ... [2025-01-09 00:05:08,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c67bb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:05:08, skipping insertion in model container [2025-01-09 00:05:08,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:05" (2/3) ... [2025-01-09 00:05:08,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c67bb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:05:08, skipping insertion in model container [2025-01-09 00:05:08,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:05:08" (3/3) ... [2025-01-09 00:05:08,723 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label59.c [2025-01-09 00:05:08,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:05:08,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label59.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:05:08,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:05:08,829 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;@22c3946e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:05:08,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:05:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 00:05:08,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:08,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:08,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:08,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1116694966, now seen corresponding path program 1 times [2025-01-09 00:05:08,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:08,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023608845] [2025-01-09 00:05:08,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:08,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:08,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 00:05:08,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 00:05:08,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:08,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:09,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:09,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023608845] [2025-01-09 00:05:09,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023608845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:09,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:09,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:05:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917195758] [2025-01-09 00:05:09,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:09,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:09,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:09,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:09,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:09,237 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 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 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:11,131 INFO L93 Difference]: Finished difference Result 1197 states and 2160 transitions. [2025-01-09 00:05:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:11,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-01-09 00:05:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:11,151 INFO L225 Difference]: With dead ends: 1197 [2025-01-09 00:05:11,152 INFO L226 Difference]: Without dead ends: 694 [2025-01-09 00:05:11,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:11,158 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 364 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:11,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 114 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:05:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-01-09 00:05:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 684. [2025-01-09 00:05:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.718887262079063) internal successors, (1174), 683 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1174 transitions. [2025-01-09 00:05:11,230 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1174 transitions. Word has length 54 [2025-01-09 00:05:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:11,230 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1174 transitions. [2025-01-09 00:05:11,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1174 transitions. [2025-01-09 00:05:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 00:05:11,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:11,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:11,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:05:11,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:11,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1820879616, now seen corresponding path program 1 times [2025-01-09 00:05:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:11,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309167379] [2025-01-09 00:05:11,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:11,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 00:05:11,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 00:05:11,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:11,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:11,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:11,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309167379] [2025-01-09 00:05:11,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309167379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:11,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:11,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:05:11,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368314810] [2025-01-09 00:05:11,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:11,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:11,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:11,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:11,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:11,621 INFO L87 Difference]: Start difference. First operand 684 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:13,184 INFO L93 Difference]: Finished difference Result 1681 states and 2896 transitions. [2025-01-09 00:05:13,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:13,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-01-09 00:05:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:13,189 INFO L225 Difference]: With dead ends: 1681 [2025-01-09 00:05:13,189 INFO L226 Difference]: Without dead ends: 999 [2025-01-09 00:05:13,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:13,194 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 254 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:13,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 226 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:05:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-01-09 00:05:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 989. [2025-01-09 00:05:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 1.6194331983805668) internal successors, (1600), 988 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1600 transitions. [2025-01-09 00:05:13,226 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1600 transitions. Word has length 119 [2025-01-09 00:05:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:13,226 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1600 transitions. [2025-01-09 00:05:13,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1600 transitions. [2025-01-09 00:05:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 00:05:13,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:13,230 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:13,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:05:13,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:13,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash -823851202, now seen corresponding path program 1 times [2025-01-09 00:05:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:13,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927236558] [2025-01-09 00:05:13,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:13,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 00:05:13,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 00:05:13,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:13,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:13,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:13,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927236558] [2025-01-09 00:05:13,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927236558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:13,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:13,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:05:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739276781] [2025-01-09 00:05:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:13,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:13,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:13,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:13,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:13,399 INFO L87 Difference]: Start difference. First operand 989 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:15,325 INFO L93 Difference]: Finished difference Result 2576 states and 4256 transitions. [2025-01-09 00:05:15,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:15,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-01-09 00:05:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:15,333 INFO L225 Difference]: With dead ends: 2576 [2025-01-09 00:05:15,334 INFO L226 Difference]: Without dead ends: 1589 [2025-01-09 00:05:15,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:15,338 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 251 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:15,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 348 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:05:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2025-01-09 00:05:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1585. [2025-01-09 00:05:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1584 states have (on average 1.3983585858585859) internal successors, (2215), 1584 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2215 transitions. [2025-01-09 00:05:15,369 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2215 transitions. Word has length 120 [2025-01-09 00:05:15,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:15,370 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2215 transitions. [2025-01-09 00:05:15,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2215 transitions. [2025-01-09 00:05:15,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 00:05:15,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:15,375 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:15,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:05:15,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:15,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash -387910924, now seen corresponding path program 1 times [2025-01-09 00:05:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:15,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215713324] [2025-01-09 00:05:15,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:15,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:15,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 00:05:15,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 00:05:15,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:15,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:15,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215713324] [2025-01-09 00:05:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215713324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:15,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:05:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107172299] [2025-01-09 00:05:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:15,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:05:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:15,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:05:15,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:05:15,655 INFO L87 Difference]: Start difference. First operand 1585 states and 2215 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:17,408 INFO L93 Difference]: Finished difference Result 3782 states and 5525 transitions. [2025-01-09 00:05:17,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:05:17,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-01-09 00:05:17,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:17,417 INFO L225 Difference]: With dead ends: 3782 [2025-01-09 00:05:17,418 INFO L226 Difference]: Without dead ends: 2498 [2025-01-09 00:05:17,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:05:17,422 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 613 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:17,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 359 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:05:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2025-01-09 00:05:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2185. [2025-01-09 00:05:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2185 states, 2184 states have (on average 1.3305860805860805) internal successors, (2906), 2184 states have internal predecessors, (2906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 2906 transitions. [2025-01-09 00:05:17,457 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 2906 transitions. Word has length 124 [2025-01-09 00:05:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:17,457 INFO L471 AbstractCegarLoop]: Abstraction has 2185 states and 2906 transitions. [2025-01-09 00:05:17,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2906 transitions. [2025-01-09 00:05:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 00:05:17,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:17,458 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:17,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:05:17,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:17,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1656421553, now seen corresponding path program 1 times [2025-01-09 00:05:17,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:17,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769111265] [2025-01-09 00:05:17,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:17,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:17,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 00:05:17,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 00:05:17,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:17,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:17,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:17,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769111265] [2025-01-09 00:05:17,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769111265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:17,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:17,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:17,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421013939] [2025-01-09 00:05:17,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:17,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:17,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:17,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:17,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:17,639 INFO L87 Difference]: Start difference. First operand 2185 states and 2906 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 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-01-09 00:05:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:18,809 INFO L93 Difference]: Finished difference Result 5566 states and 7574 transitions. [2025-01-09 00:05:18,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:18,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 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 145 [2025-01-09 00:05:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:18,822 INFO L225 Difference]: With dead ends: 5566 [2025-01-09 00:05:18,822 INFO L226 Difference]: Without dead ends: 3383 [2025-01-09 00:05:18,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:18,827 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 290 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:18,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 614 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:05:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2025-01-09 00:05:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 3383. [2025-01-09 00:05:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3383 states, 3382 states have (on average 1.2554701360141929) internal successors, (4246), 3382 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 4246 transitions. [2025-01-09 00:05:18,894 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 4246 transitions. Word has length 145 [2025-01-09 00:05:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:18,894 INFO L471 AbstractCegarLoop]: Abstraction has 3383 states and 4246 transitions. [2025-01-09 00:05:18,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 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-01-09 00:05:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 4246 transitions. [2025-01-09 00:05:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-09 00:05:18,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:18,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:18,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:05:18,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:18,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1665534909, now seen corresponding path program 1 times [2025-01-09 00:05:18,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:18,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436473796] [2025-01-09 00:05:18,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:18,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:18,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 00:05:18,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 00:05:18,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:18,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:19,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:19,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436473796] [2025-01-09 00:05:19,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436473796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767552907] [2025-01-09 00:05:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:19,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:05:19,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:19,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:05:19,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:05:19,331 INFO L87 Difference]: Start difference. First operand 3383 states and 4246 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:21,697 INFO L93 Difference]: Finished difference Result 10676 states and 13350 transitions. [2025-01-09 00:05:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:05:21,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 287 [2025-01-09 00:05:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:21,736 INFO L225 Difference]: With dead ends: 10676 [2025-01-09 00:05:21,736 INFO L226 Difference]: Without dead ends: 7295 [2025-01-09 00:05:21,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:05:21,744 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 489 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:21,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 124 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:05:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7295 states. [2025-01-09 00:05:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7295 to 5483. [2025-01-09 00:05:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5483 states, 5482 states have (on average 1.2832907697920466) internal successors, (7035), 5482 states have internal predecessors, (7035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 7035 transitions. [2025-01-09 00:05:21,904 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 7035 transitions. Word has length 287 [2025-01-09 00:05:21,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:21,905 INFO L471 AbstractCegarLoop]: Abstraction has 5483 states and 7035 transitions. [2025-01-09 00:05:21,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 7035 transitions. [2025-01-09 00:05:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-01-09 00:05:21,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:21,914 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:21,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:05:21,914 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1488032209, now seen corresponding path program 1 times [2025-01-09 00:05:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386345646] [2025-01-09 00:05:21,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:21,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 00:05:21,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 00:05:21,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:21,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:22,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386345646] [2025-01-09 00:05:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386345646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:22,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:22,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577569120] [2025-01-09 00:05:22,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:22,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:05:22,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:22,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:05:22,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:05:22,139 INFO L87 Difference]: Start difference. First operand 5483 states and 7035 transitions. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:24,570 INFO L93 Difference]: Finished difference Result 13999 states and 18196 transitions. [2025-01-09 00:05:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:05:24,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 303 [2025-01-09 00:05:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:24,600 INFO L225 Difference]: With dead ends: 13999 [2025-01-09 00:05:24,600 INFO L226 Difference]: Without dead ends: 8817 [2025-01-09 00:05:24,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:05:24,610 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 410 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:24,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 360 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:05:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8817 states. [2025-01-09 00:05:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8817 to 8790. [2025-01-09 00:05:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8790 states, 8789 states have (on average 1.2437137330754353) internal successors, (10931), 8789 states have internal predecessors, (10931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8790 states to 8790 states and 10931 transitions. [2025-01-09 00:05:24,797 INFO L78 Accepts]: Start accepts. Automaton has 8790 states and 10931 transitions. Word has length 303 [2025-01-09 00:05:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:24,798 INFO L471 AbstractCegarLoop]: Abstraction has 8790 states and 10931 transitions. [2025-01-09 00:05:24,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 8790 states and 10931 transitions. [2025-01-09 00:05:24,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 00:05:24,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:24,803 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:05:24,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:05:24,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:24,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:24,804 INFO L85 PathProgramCache]: Analyzing trace with hash 352386431, now seen corresponding path program 1 times [2025-01-09 00:05:24,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:24,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156368623] [2025-01-09 00:05:24,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:24,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:24,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 00:05:24,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 00:05:24,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:24,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-01-09 00:05:24,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:24,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156368623] [2025-01-09 00:05:24,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156368623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:24,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:24,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:05:24,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350432941] [2025-01-09 00:05:24,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:24,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:24,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:24,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:24,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:24,986 INFO L87 Difference]: Start difference. First operand 8790 states and 10931 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:26,254 INFO L93 Difference]: Finished difference Result 22968 states and 28912 transitions. [2025-01-09 00:05:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:26,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2025-01-09 00:05:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:26,284 INFO L225 Difference]: With dead ends: 22968 [2025-01-09 00:05:26,284 INFO L226 Difference]: Without dead ends: 12687 [2025-01-09 00:05:26,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:26,293 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 257 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:26,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 333 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:05:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12687 states. [2025-01-09 00:05:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12687 to 10884. [2025-01-09 00:05:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10884 states, 10883 states have (on average 1.1476614903978681) internal successors, (12490), 10883 states have internal predecessors, (12490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10884 states to 10884 states and 12490 transitions. [2025-01-09 00:05:26,425 INFO L78 Accepts]: Start accepts. Automaton has 10884 states and 12490 transitions. Word has length 323 [2025-01-09 00:05:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:26,425 INFO L471 AbstractCegarLoop]: Abstraction has 10884 states and 12490 transitions. [2025-01-09 00:05:26,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 10884 states and 12490 transitions. [2025-01-09 00:05:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 00:05:26,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:26,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:26,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:05:26,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:26,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:26,430 INFO L85 PathProgramCache]: Analyzing trace with hash 10264108, now seen corresponding path program 1 times [2025-01-09 00:05:26,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:26,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738083279] [2025-01-09 00:05:26,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:26,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:26,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 00:05:26,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 00:05:26,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:26,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:27,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:27,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738083279] [2025-01-09 00:05:27,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738083279] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:05:27,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790316412] [2025-01-09 00:05:27,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:27,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:27,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:05:27,027 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:05:27,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:05:27,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 00:05:27,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 00:05:27,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:27,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:27,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:05:27,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:05:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:27,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:05:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790316412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:27,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:05:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:05:27,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172677736] [2025-01-09 00:05:27,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:27,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:27,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:27,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:27,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:05:27,312 INFO L87 Difference]: Start difference. First operand 10884 states and 12490 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:28,230 INFO L93 Difference]: Finished difference Result 21767 states and 24981 transitions. [2025-01-09 00:05:28,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:28,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 324 [2025-01-09 00:05:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:28,255 INFO L225 Difference]: With dead ends: 21767 [2025-01-09 00:05:28,255 INFO L226 Difference]: Without dead ends: 10885 [2025-01-09 00:05:28,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 323 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-01-09 00:05:28,267 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 331 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:28,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 418 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:05:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10885 states. [2025-01-09 00:05:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10885 to 10882. [2025-01-09 00:05:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10882 states, 10881 states have (on average 1.1293998713353552) internal successors, (12289), 10881 states have internal predecessors, (12289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10882 states to 10882 states and 12289 transitions. [2025-01-09 00:05:28,435 INFO L78 Accepts]: Start accepts. Automaton has 10882 states and 12289 transitions. Word has length 324 [2025-01-09 00:05:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:28,435 INFO L471 AbstractCegarLoop]: Abstraction has 10882 states and 12289 transitions. [2025-01-09 00:05:28,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 10882 states and 12289 transitions. [2025-01-09 00:05:28,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-09 00:05:28,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:28,440 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:28,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:05:28,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:28,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:28,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash -254735605, now seen corresponding path program 1 times [2025-01-09 00:05:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:28,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203718102] [2025-01-09 00:05:28,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:28,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:28,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 00:05:28,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 00:05:28,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:28,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 00:05:28,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:28,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203718102] [2025-01-09 00:05:28,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203718102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:28,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:28,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:05:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471953844] [2025-01-09 00:05:28,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:28,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:28,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:28,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:28,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:28,990 INFO L87 Difference]: Start difference. First operand 10882 states and 12289 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:29,871 INFO L93 Difference]: Finished difference Result 22061 states and 24879 transitions. [2025-01-09 00:05:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:29,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 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 337 [2025-01-09 00:05:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:29,908 INFO L225 Difference]: With dead ends: 22061 [2025-01-09 00:05:29,908 INFO L226 Difference]: Without dead ends: 11181 [2025-01-09 00:05:29,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:29,927 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:29,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 303 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:05:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11181 states. [2025-01-09 00:05:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11181 to 11181. [2025-01-09 00:05:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11181 states, 11180 states have (on average 1.1261180679785332) internal successors, (12590), 11180 states have internal predecessors, (12590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11181 states to 11181 states and 12590 transitions. [2025-01-09 00:05:30,036 INFO L78 Accepts]: Start accepts. Automaton has 11181 states and 12590 transitions. Word has length 337 [2025-01-09 00:05:30,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:30,036 INFO L471 AbstractCegarLoop]: Abstraction has 11181 states and 12590 transitions. [2025-01-09 00:05:30,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 11181 states and 12590 transitions. [2025-01-09 00:05:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-01-09 00:05:30,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:30,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:30,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:05:30,041 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:30,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1237032588, now seen corresponding path program 1 times [2025-01-09 00:05:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:30,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316459495] [2025-01-09 00:05:30,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:30,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:30,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-01-09 00:05:30,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-01-09 00:05:30,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:30,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:30,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:30,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316459495] [2025-01-09 00:05:30,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316459495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:30,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:30,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:30,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719639830] [2025-01-09 00:05:30,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:30,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:30,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:30,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:30,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:30,440 INFO L87 Difference]: Start difference. First operand 11181 states and 12590 transitions. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:31,428 INFO L93 Difference]: Finished difference Result 25658 states and 29188 transitions. [2025-01-09 00:05:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:31,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 423 [2025-01-09 00:05:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:31,444 INFO L225 Difference]: With dead ends: 25658 [2025-01-09 00:05:31,444 INFO L226 Difference]: Without dead ends: 14778 [2025-01-09 00:05:31,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:31,455 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 218 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:31,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 599 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:05:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14778 states. [2025-01-09 00:05:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14778 to 14170. [2025-01-09 00:05:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14170 states, 14169 states have (on average 1.1081233679158726) internal successors, (15701), 14169 states have internal predecessors, (15701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14170 states to 14170 states and 15701 transitions. [2025-01-09 00:05:31,671 INFO L78 Accepts]: Start accepts. Automaton has 14170 states and 15701 transitions. Word has length 423 [2025-01-09 00:05:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:31,671 INFO L471 AbstractCegarLoop]: Abstraction has 14170 states and 15701 transitions. [2025-01-09 00:05:31,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 14170 states and 15701 transitions. [2025-01-09 00:05:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-01-09 00:05:31,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:31,676 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:31,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:05:31,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1317274888, now seen corresponding path program 1 times [2025-01-09 00:05:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130563790] [2025-01-09 00:05:31,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:31,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-01-09 00:05:31,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-01-09 00:05:31,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:31,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-09 00:05:32,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:32,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130563790] [2025-01-09 00:05:32,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130563790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:32,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:32,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:32,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967453899] [2025-01-09 00:05:32,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:32,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:05:32,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:32,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:05:32,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:05:32,082 INFO L87 Difference]: Start difference. First operand 14170 states and 15701 transitions. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:33,746 INFO L93 Difference]: Finished difference Result 33148 states and 36887 transitions. [2025-01-09 00:05:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:05:33,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 467 [2025-01-09 00:05:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:33,767 INFO L225 Difference]: With dead ends: 33148 [2025-01-09 00:05:33,767 INFO L226 Difference]: Without dead ends: 18681 [2025-01-09 00:05:33,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:05:33,779 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 435 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:33,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 119 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:05:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18681 states. [2025-01-09 00:05:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18681 to 13574. [2025-01-09 00:05:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13574 states, 13573 states have (on average 1.1094820599720032) internal successors, (15059), 13573 states have internal predecessors, (15059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13574 states to 13574 states and 15059 transitions. [2025-01-09 00:05:33,925 INFO L78 Accepts]: Start accepts. Automaton has 13574 states and 15059 transitions. Word has length 467 [2025-01-09 00:05:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:33,925 INFO L471 AbstractCegarLoop]: Abstraction has 13574 states and 15059 transitions. [2025-01-09 00:05:33,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 13574 states and 15059 transitions. [2025-01-09 00:05:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-01-09 00:05:33,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:33,930 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:33,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:05:33,931 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:33,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:33,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1044392287, now seen corresponding path program 1 times [2025-01-09 00:05:33,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:33,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171509640] [2025-01-09 00:05:33,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:33,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:33,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-01-09 00:05:34,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-01-09 00:05:34,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:34,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 273 proven. 196 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 00:05:34,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:34,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171509640] [2025-01-09 00:05:34,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171509640] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:05:34,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90301402] [2025-01-09 00:05:34,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:34,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:05:34,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:05:34,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:05:34,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-01-09 00:05:34,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-01-09 00:05:34,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:34,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:34,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:05:34,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:05:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-01-09 00:05:35,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:05:35,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90301402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:35,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:05:35,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:05:35,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485523767] [2025-01-09 00:05:35,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:35,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:35,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:35,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:35,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:05:35,053 INFO L87 Difference]: Start difference. First operand 13574 states and 15059 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:35,903 INFO L93 Difference]: Finished difference Result 31032 states and 34678 transitions. [2025-01-09 00:05:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:35,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 541 [2025-01-09 00:05:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:35,919 INFO L225 Difference]: With dead ends: 31032 [2025-01-09 00:05:35,919 INFO L226 Difference]: Without dead ends: 17759 [2025-01-09 00:05:35,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:05:35,926 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 360 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:35,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 444 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:05:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17759 states. [2025-01-09 00:05:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17759 to 15367. [2025-01-09 00:05:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15367 states, 15366 states have (on average 1.1163607965638422) internal successors, (17154), 15366 states have internal predecessors, (17154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15367 states to 15367 states and 17154 transitions. [2025-01-09 00:05:36,057 INFO L78 Accepts]: Start accepts. Automaton has 15367 states and 17154 transitions. Word has length 541 [2025-01-09 00:05:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:36,058 INFO L471 AbstractCegarLoop]: Abstraction has 15367 states and 17154 transitions. [2025-01-09 00:05:36,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 15367 states and 17154 transitions. [2025-01-09 00:05:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-01-09 00:05:36,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:36,064 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:36,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:05:36,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:36,265 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:36,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash -789515420, now seen corresponding path program 1 times [2025-01-09 00:05:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:36,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110915189] [2025-01-09 00:05:36,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:36,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:36,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 00:05:36,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 00:05:36,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:36,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-09 00:05:36,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:36,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110915189] [2025-01-09 00:05:36,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110915189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:36,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:36,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426211658] [2025-01-09 00:05:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:36,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:36,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:36,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:36,558 INFO L87 Difference]: Start difference. First operand 15367 states and 17154 transitions. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:37,523 INFO L93 Difference]: Finished difference Result 34922 states and 39415 transitions. [2025-01-09 00:05:37,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:37,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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 587 [2025-01-09 00:05:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:37,543 INFO L225 Difference]: With dead ends: 34922 [2025-01-09 00:05:37,543 INFO L226 Difference]: Without dead ends: 19856 [2025-01-09 00:05:37,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:37,554 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 256 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:37,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 566 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:05:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19856 states. [2025-01-09 00:05:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19856 to 18053. [2025-01-09 00:05:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18053 states, 18052 states have (on average 1.1051407046310657) internal successors, (19950), 18052 states have internal predecessors, (19950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18053 states to 18053 states and 19950 transitions. [2025-01-09 00:05:37,807 INFO L78 Accepts]: Start accepts. Automaton has 18053 states and 19950 transitions. Word has length 587 [2025-01-09 00:05:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:37,808 INFO L471 AbstractCegarLoop]: Abstraction has 18053 states and 19950 transitions. [2025-01-09 00:05:37,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 18053 states and 19950 transitions. [2025-01-09 00:05:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2025-01-09 00:05:37,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:37,814 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:37,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:05:37,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:37,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1201590868, now seen corresponding path program 1 times [2025-01-09 00:05:37,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:37,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566684004] [2025-01-09 00:05:37,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:37,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:37,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-01-09 00:05:37,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-01-09 00:05:37,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:37,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 467 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-01-09 00:05:38,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:38,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566684004] [2025-01-09 00:05:38,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566684004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:38,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:38,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:38,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792852176] [2025-01-09 00:05:38,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:38,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:38,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:38,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:38,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:38,302 INFO L87 Difference]: Start difference. First operand 18053 states and 19950 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:39,104 INFO L93 Difference]: Finished difference Result 35811 states and 39604 transitions. [2025-01-09 00:05:39,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:39,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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 668 [2025-01-09 00:05:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:39,123 INFO L225 Difference]: With dead ends: 35811 [2025-01-09 00:05:39,123 INFO L226 Difference]: Without dead ends: 18059 [2025-01-09 00:05:39,140 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-01-09 00:05:39,140 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 298 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:39,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 141 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:05:39,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18059 states. [2025-01-09 00:05:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18059 to 17754. [2025-01-09 00:05:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17754 states, 17753 states have (on average 1.0954768208190164) internal successors, (19448), 17753 states have internal predecessors, (19448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17754 states to 17754 states and 19448 transitions. [2025-01-09 00:05:39,301 INFO L78 Accepts]: Start accepts. Automaton has 17754 states and 19448 transitions. Word has length 668 [2025-01-09 00:05:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:39,301 INFO L471 AbstractCegarLoop]: Abstraction has 17754 states and 19448 transitions. [2025-01-09 00:05:39,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 17754 states and 19448 transitions. [2025-01-09 00:05:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-01-09 00:05:39,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:39,308 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:39,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:05:39,309 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:39,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1832575929, now seen corresponding path program 1 times [2025-01-09 00:05:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:39,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021604448] [2025-01-09 00:05:39,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:39,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:39,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-01-09 00:05:39,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-01-09 00:05:39,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:39,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 00:05:39,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021604448] [2025-01-09 00:05:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021604448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:39,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:39,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:39,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949915024] [2025-01-09 00:05:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:39,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:39,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:39,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:39,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:39,724 INFO L87 Difference]: Start difference. First operand 17754 states and 19448 transitions. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:41,401 INFO L93 Difference]: Finished difference Result 37899 states and 41816 transitions. [2025-01-09 00:05:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:41,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 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-01-09 00:05:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:41,431 INFO L225 Difference]: With dead ends: 37899 [2025-01-09 00:05:41,431 INFO L226 Difference]: Without dead ends: 20446 [2025-01-09 00:05:41,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:41,453 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 144 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:41,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 590 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:05:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20446 states. [2025-01-09 00:05:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20446 to 20147. [2025-01-09 00:05:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20147 states, 20146 states have (on average 1.080958999305073) internal successors, (21777), 20146 states have internal predecessors, (21777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20147 states to 20147 states and 21777 transitions. [2025-01-09 00:05:41,695 INFO L78 Accepts]: Start accepts. Automaton has 20147 states and 21777 transitions. Word has length 679 [2025-01-09 00:05:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:41,696 INFO L471 AbstractCegarLoop]: Abstraction has 20147 states and 21777 transitions. [2025-01-09 00:05:41,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 20147 states and 21777 transitions. [2025-01-09 00:05:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2025-01-09 00:05:41,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:41,707 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:41,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:05:41,707 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:41,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash -766767564, now seen corresponding path program 1 times [2025-01-09 00:05:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:41,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183066202] [2025-01-09 00:05:41,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:41,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:41,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-01-09 00:05:41,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-01-09 00:05:41,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:41,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 00:05:42,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:42,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183066202] [2025-01-09 00:05:42,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183066202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:42,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:42,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:05:42,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250448062] [2025-01-09 00:05:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:42,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:05:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:42,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:05:42,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:05:42,488 INFO L87 Difference]: Start difference. First operand 20147 states and 21777 transitions. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:43,633 INFO L93 Difference]: Finished difference Result 40344 states and 43610 transitions. [2025-01-09 00:05:43,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:05:43,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 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 682 [2025-01-09 00:05:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:43,661 INFO L225 Difference]: With dead ends: 40344 [2025-01-09 00:05:43,661 INFO L226 Difference]: Without dead ends: 20498 [2025-01-09 00:05:43,675 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-01-09 00:05:43,675 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 452 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:43,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 587 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:05:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20498 states. [2025-01-09 00:05:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20498 to 20147. [2025-01-09 00:05:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20147 states, 20146 states have (on average 1.0807108110791224) internal successors, (21772), 20146 states have internal predecessors, (21772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20147 states to 20147 states and 21772 transitions. [2025-01-09 00:05:43,836 INFO L78 Accepts]: Start accepts. Automaton has 20147 states and 21772 transitions. Word has length 682 [2025-01-09 00:05:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:43,836 INFO L471 AbstractCegarLoop]: Abstraction has 20147 states and 21772 transitions. [2025-01-09 00:05:43,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 20147 states and 21772 transitions. [2025-01-09 00:05:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-01-09 00:05:43,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:43,844 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:43,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:05:43,844 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:43,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1465148438, now seen corresponding path program 1 times [2025-01-09 00:05:43,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:43,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210623956] [2025-01-09 00:05:43,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:43,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-01-09 00:05:43,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-01-09 00:05:43,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:43,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 262 proven. 372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:44,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210623956] [2025-01-09 00:05:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210623956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:05:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120679324] [2025-01-09 00:05:44,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:44,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:44,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:05:44,911 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:05:44,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:05:44,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-01-09 00:05:45,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-01-09 00:05:45,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:45,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:45,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 00:05:45,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:05:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 527 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:46,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:05:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 527 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:47,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120679324] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:05:47,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:05:47,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-01-09 00:05:47,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025680216] [2025-01-09 00:05:47,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:05:47,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 00:05:47,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:47,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 00:05:47,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:05:47,701 INFO L87 Difference]: Start difference. First operand 20147 states and 21772 transitions. Second operand has 10 states, 10 states have (on average 145.6) internal successors, (1456), 10 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:54,371 INFO L93 Difference]: Finished difference Result 51805 states and 55791 transitions. [2025-01-09 00:05:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 00:05:54,371 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 145.6) internal successors, (1456), 10 states have internal predecessors, (1456), 0 states have call successors, (0), 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 698 [2025-01-09 00:05:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:54,403 INFO L225 Difference]: With dead ends: 51805 [2025-01-09 00:05:54,404 INFO L226 Difference]: Without dead ends: 31959 [2025-01-09 00:05:54,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1432 GetRequests, 1403 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2025-01-09 00:05:54,417 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 3527 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 8907 mSolverCounterSat, 1440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3527 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 10347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1440 IncrementalHoareTripleChecker+Valid, 8907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:54,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3527 Valid, 407 Invalid, 10347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1440 Valid, 8907 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-01-09 00:05:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31959 states. [2025-01-09 00:05:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31959 to 28823. [2025-01-09 00:05:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28823 states, 28822 states have (on average 1.069460828533759) internal successors, (30824), 28822 states have internal predecessors, (30824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28823 states to 28823 states and 30824 transitions. [2025-01-09 00:05:54,685 INFO L78 Accepts]: Start accepts. Automaton has 28823 states and 30824 transitions. Word has length 698 [2025-01-09 00:05:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:54,686 INFO L471 AbstractCegarLoop]: Abstraction has 28823 states and 30824 transitions. [2025-01-09 00:05:54,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 145.6) internal successors, (1456), 10 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 28823 states and 30824 transitions. [2025-01-09 00:05:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2025-01-09 00:05:54,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:54,695 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:54,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:05:54,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:05:54,896 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:54,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:54,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1658746294, now seen corresponding path program 1 times [2025-01-09 00:05:54,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:54,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311776474] [2025-01-09 00:05:54,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:54,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 723 statements into 1 equivalence classes. [2025-01-09 00:05:54,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 723 of 723 statements. [2025-01-09 00:05:54,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:54,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2025-01-09 00:05:55,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:55,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311776474] [2025-01-09 00:05:55,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311776474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:55,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:55,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:55,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043529974] [2025-01-09 00:05:55,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:55,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:55,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:55,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:55,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:55,127 INFO L87 Difference]: Start difference. First operand 28823 states and 30824 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:56,050 INFO L93 Difference]: Finished difference Result 57642 states and 61648 transitions. [2025-01-09 00:05:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:56,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 723 [2025-01-09 00:05:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:56,082 INFO L225 Difference]: With dead ends: 57642 [2025-01-09 00:05:56,082 INFO L226 Difference]: Without dead ends: 29120 [2025-01-09 00:05:56,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:56,099 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 463 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:56,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 69 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:05:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29120 states. [2025-01-09 00:05:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29120 to 28821. [2025-01-09 00:05:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28821 states, 28820 states have (on average 1.0693962526023595) internal successors, (30820), 28820 states have internal predecessors, (30820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28821 states to 28821 states and 30820 transitions. [2025-01-09 00:05:56,339 INFO L78 Accepts]: Start accepts. Automaton has 28821 states and 30820 transitions. Word has length 723 [2025-01-09 00:05:56,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:56,340 INFO L471 AbstractCegarLoop]: Abstraction has 28821 states and 30820 transitions. [2025-01-09 00:05:56,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 28821 states and 30820 transitions. [2025-01-09 00:05:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 739 [2025-01-09 00:05:56,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:56,348 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:56,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:05:56,348 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:56,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:56,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1783233478, now seen corresponding path program 1 times [2025-01-09 00:05:56,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:56,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432731022] [2025-01-09 00:05:56,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:56,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:56,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 738 statements into 1 equivalence classes. [2025-01-09 00:05:56,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 738 of 738 statements. [2025-01-09 00:05:56,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:56,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 805 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-09 00:05:56,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:56,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432731022] [2025-01-09 00:05:56,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432731022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:56,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:56,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216259476] [2025-01-09 00:05:56,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:56,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:56,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:56,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:56,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:56,673 INFO L87 Difference]: Start difference. First operand 28821 states and 30820 transitions. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:57,708 INFO L93 Difference]: Finished difference Result 58832 states and 63142 transitions. [2025-01-09 00:05:57,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:57,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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 738 [2025-01-09 00:05:57,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:57,745 INFO L225 Difference]: With dead ends: 58832 [2025-01-09 00:05:57,745 INFO L226 Difference]: Without dead ends: 30312 [2025-01-09 00:05:57,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:57,756 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 218 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:57,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 173 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:05:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30312 states. [2025-01-09 00:05:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30312 to 29415. [2025-01-09 00:05:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29415 states, 29414 states have (on average 1.0649010675188686) internal successors, (31323), 29414 states have internal predecessors, (31323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29415 states to 29415 states and 31323 transitions. [2025-01-09 00:05:58,129 INFO L78 Accepts]: Start accepts. Automaton has 29415 states and 31323 transitions. Word has length 738 [2025-01-09 00:05:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:58,129 INFO L471 AbstractCegarLoop]: Abstraction has 29415 states and 31323 transitions. [2025-01-09 00:05:58,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 29415 states and 31323 transitions. [2025-01-09 00:05:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 00:05:58,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:58,145 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:05:58,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:05:58,145 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:58,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:58,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1163960903, now seen corresponding path program 1 times [2025-01-09 00:05:58,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:58,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683387993] [2025-01-09 00:05:58,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:58,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:58,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 00:05:58,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 00:05:58,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:58,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2025-01-09 00:05:58,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:58,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683387993] [2025-01-09 00:05:58,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683387993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:58,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:58,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:58,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232464277] [2025-01-09 00:05:58,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:58,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:58,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:58,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:58,743 INFO L87 Difference]: Start difference. First operand 29415 states and 31323 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:59,908 INFO L93 Difference]: Finished difference Result 67831 states and 72211 transitions. [2025-01-09 00:05:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:59,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 777 [2025-01-09 00:05:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:59,956 INFO L225 Difference]: With dead ends: 67831 [2025-01-09 00:05:59,956 INFO L226 Difference]: Without dead ends: 33634 [2025-01-09 00:05:59,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:59,979 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 344 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:59,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 430 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:06:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33634 states. [2025-01-09 00:06:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33634 to 28839. [2025-01-09 00:06:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28839 states, 28838 states have (on average 1.0584298495041264) internal successors, (30523), 28838 states have internal predecessors, (30523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28839 states to 28839 states and 30523 transitions. [2025-01-09 00:06:00,306 INFO L78 Accepts]: Start accepts. Automaton has 28839 states and 30523 transitions. Word has length 777 [2025-01-09 00:06:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:00,306 INFO L471 AbstractCegarLoop]: Abstraction has 28839 states and 30523 transitions. [2025-01-09 00:06:00,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 28839 states and 30523 transitions. [2025-01-09 00:06:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2025-01-09 00:06:00,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:00,320 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:00,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:06:00,320 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:00,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash -847885129, now seen corresponding path program 1 times [2025-01-09 00:06:00,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:00,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436151900] [2025-01-09 00:06:00,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:00,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:00,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 842 statements into 1 equivalence classes. [2025-01-09 00:06:00,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 842 of 842 statements. [2025-01-09 00:06:00,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:00,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 1114 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-01-09 00:06:00,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:00,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436151900] [2025-01-09 00:06:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436151900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:00,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:00,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106695788] [2025-01-09 00:06:00,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:00,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:00,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:00,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:00,996 INFO L87 Difference]: Start difference. First operand 28839 states and 30523 transitions. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:01,904 INFO L93 Difference]: Finished difference Result 61862 states and 65394 transitions. [2025-01-09 00:06:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:01,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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 842 [2025-01-09 00:06:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:01,946 INFO L225 Difference]: With dead ends: 61862 [2025-01-09 00:06:01,946 INFO L226 Difference]: Without dead ends: 33324 [2025-01-09 00:06:01,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:01,972 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 215 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:01,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 513 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33324 states. [2025-01-09 00:06:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33324 to 29431. [2025-01-09 00:06:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29431 states, 29430 states have (on average 1.055929323819232) internal successors, (31076), 29430 states have internal predecessors, (31076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29431 states to 29431 states and 31076 transitions. [2025-01-09 00:06:02,353 INFO L78 Accepts]: Start accepts. Automaton has 29431 states and 31076 transitions. Word has length 842 [2025-01-09 00:06:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:02,354 INFO L471 AbstractCegarLoop]: Abstraction has 29431 states and 31076 transitions. [2025-01-09 00:06:02,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 29431 states and 31076 transitions. [2025-01-09 00:06:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2025-01-09 00:06:02,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:02,366 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:02,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:06:02,367 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:02,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1176500047, now seen corresponding path program 1 times [2025-01-09 00:06:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:02,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601135290] [2025-01-09 00:06:02,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:02,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 877 statements into 1 equivalence classes. [2025-01-09 00:06:02,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 877 of 877 statements. [2025-01-09 00:06:02,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:02,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2025-01-09 00:06:03,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:03,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601135290] [2025-01-09 00:06:03,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601135290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:03,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768832147] [2025-01-09 00:06:03,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:03,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:03,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:03,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:03,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:03,033 INFO L87 Difference]: Start difference. First operand 29431 states and 31076 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:03,953 INFO L93 Difference]: Finished difference Result 60962 states and 64295 transitions. [2025-01-09 00:06:03,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:03,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 877 [2025-01-09 00:06:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:03,984 INFO L225 Difference]: With dead ends: 60962 [2025-01-09 00:06:03,984 INFO L226 Difference]: Without dead ends: 31533 [2025-01-09 00:06:04,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:04,000 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 329 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:04,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 441 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:06:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31533 states. [2025-01-09 00:06:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31533 to 29132. [2025-01-09 00:06:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29132 states, 29131 states have (on average 1.0561601043561841) internal successors, (30767), 29131 states have internal predecessors, (30767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29132 states to 29132 states and 30767 transitions. [2025-01-09 00:06:04,313 INFO L78 Accepts]: Start accepts. Automaton has 29132 states and 30767 transitions. Word has length 877 [2025-01-09 00:06:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:04,317 INFO L471 AbstractCegarLoop]: Abstraction has 29132 states and 30767 transitions. [2025-01-09 00:06:04,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 29132 states and 30767 transitions. [2025-01-09 00:06:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2025-01-09 00:06:04,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:04,329 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:04,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:06:04,330 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:04,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash -806494915, now seen corresponding path program 1 times [2025-01-09 00:06:04,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:04,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135583687] [2025-01-09 00:06:04,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:04,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 882 statements into 1 equivalence classes. [2025-01-09 00:06:04,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 882 of 882 statements. [2025-01-09 00:06:04,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:04,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-01-09 00:06:04,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:04,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135583687] [2025-01-09 00:06:04,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135583687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:04,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:04,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:04,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654897193] [2025-01-09 00:06:04,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:04,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:04,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:04,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:04,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:04,932 INFO L87 Difference]: Start difference. First operand 29132 states and 30767 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:05,994 INFO L93 Difference]: Finished difference Result 66052 states and 69800 transitions. [2025-01-09 00:06:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:05,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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 882 [2025-01-09 00:06:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:06,034 INFO L225 Difference]: With dead ends: 66052 [2025-01-09 00:06:06,034 INFO L226 Difference]: Without dead ends: 37520 [2025-01-09 00:06:06,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:06,056 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 350 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:06,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 145 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:06:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37520 states. [2025-01-09 00:06:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37520 to 32718. [2025-01-09 00:06:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32718 states, 32717 states have (on average 1.05657609193997) internal successors, (34568), 32717 states have internal predecessors, (34568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32718 states to 32718 states and 34568 transitions. [2025-01-09 00:06:06,390 INFO L78 Accepts]: Start accepts. Automaton has 32718 states and 34568 transitions. Word has length 882 [2025-01-09 00:06:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:06,391 INFO L471 AbstractCegarLoop]: Abstraction has 32718 states and 34568 transitions. [2025-01-09 00:06:06,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 32718 states and 34568 transitions. [2025-01-09 00:06:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2025-01-09 00:06:06,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:06,406 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:06,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 00:06:06,407 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:06,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:06,407 INFO L85 PathProgramCache]: Analyzing trace with hash 883590856, now seen corresponding path program 1 times [2025-01-09 00:06:06,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:06,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700904512] [2025-01-09 00:06:06,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:06,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:06,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 896 statements into 1 equivalence classes. [2025-01-09 00:06:06,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 896 of 896 statements. [2025-01-09 00:06:06,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:06,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1481 backedges. 1090 proven. 0 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-01-09 00:06:07,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700904512] [2025-01-09 00:06:07,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700904512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:07,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:06:07,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982054961] [2025-01-09 00:06:07,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:06:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:07,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:06:07,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:06:07,364 INFO L87 Difference]: Start difference. First operand 32718 states and 34568 transitions. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:08,393 INFO L93 Difference]: Finished difference Result 65227 states and 68927 transitions. [2025-01-09 00:06:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:06:08,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 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 896 [2025-01-09 00:06:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:08,426 INFO L225 Difference]: With dead ends: 65227 [2025-01-09 00:06:08,426 INFO L226 Difference]: Without dead ends: 33109 [2025-01-09 00:06:08,446 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-01-09 00:06:08,446 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 390 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:08,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 571 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:06:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33109 states. [2025-01-09 00:06:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33109 to 33017. [2025-01-09 00:06:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33017 states, 33016 states have (on average 1.056124303368064) internal successors, (34869), 33016 states have internal predecessors, (34869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33017 states to 33017 states and 34869 transitions. [2025-01-09 00:06:08,738 INFO L78 Accepts]: Start accepts. Automaton has 33017 states and 34869 transitions. Word has length 896 [2025-01-09 00:06:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:08,740 INFO L471 AbstractCegarLoop]: Abstraction has 33017 states and 34869 transitions. [2025-01-09 00:06:08,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 33017 states and 34869 transitions. [2025-01-09 00:06:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2025-01-09 00:06:08,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:08,820 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:08,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 00:06:08,820 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:08,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1245545748, now seen corresponding path program 1 times [2025-01-09 00:06:08,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:08,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568713488] [2025-01-09 00:06:08,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:08,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 902 statements into 1 equivalence classes. [2025-01-09 00:06:08,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 902 of 902 statements. [2025-01-09 00:06:08,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:08,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 767 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2025-01-09 00:06:09,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:09,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568713488] [2025-01-09 00:06:09,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568713488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:09,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:09,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:06:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130960322] [2025-01-09 00:06:09,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:09,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:06:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:09,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:06:09,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:06:09,910 INFO L87 Difference]: Start difference. First operand 33017 states and 34869 transitions. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:11,513 INFO L93 Difference]: Finished difference Result 78314 states and 82567 transitions. [2025-01-09 00:06:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:06:11,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 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 902 [2025-01-09 00:06:11,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:11,568 INFO L225 Difference]: With dead ends: 78314 [2025-01-09 00:06:11,568 INFO L226 Difference]: Without dead ends: 45299 [2025-01-09 00:06:11,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:06:11,596 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 531 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:11,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 141 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:06:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45299 states. [2025-01-09 00:06:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45299 to 39604. [2025-01-09 00:06:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39604 states, 39603 states have (on average 1.0559048556927506) internal successors, (41817), 39603 states have internal predecessors, (41817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39604 states to 39604 states and 41817 transitions. [2025-01-09 00:06:12,062 INFO L78 Accepts]: Start accepts. Automaton has 39604 states and 41817 transitions. Word has length 902 [2025-01-09 00:06:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:12,062 INFO L471 AbstractCegarLoop]: Abstraction has 39604 states and 41817 transitions. [2025-01-09 00:06:12,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 39604 states and 41817 transitions. [2025-01-09 00:06:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2025-01-09 00:06:12,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:12,075 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:12,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 00:06:12,075 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:12,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1699829774, now seen corresponding path program 1 times [2025-01-09 00:06:12,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:12,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160478856] [2025-01-09 00:06:12,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:12,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 931 statements into 1 equivalence classes. [2025-01-09 00:06:12,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 931 of 931 statements. [2025-01-09 00:06:12,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:12,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 1069 proven. 143 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 00:06:12,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:12,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160478856] [2025-01-09 00:06:12,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160478856] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:06:12,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790110712] [2025-01-09 00:06:12,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:12,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:12,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:12,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:06:12,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:06:13,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 931 statements into 1 equivalence classes. [2025-01-09 00:06:13,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 931 of 931 statements. [2025-01-09 00:06:13,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:13,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:13,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:06:13,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:06:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 782 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2025-01-09 00:06:13,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:06:13,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790110712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:13,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:06:13,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-01-09 00:06:13,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629093986] [2025-01-09 00:06:13,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:13,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:06:13,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:13,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:06:13,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:13,716 INFO L87 Difference]: Start difference. First operand 39604 states and 41817 transitions. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:15,194 INFO L93 Difference]: Finished difference Result 87000 states and 91620 transitions. [2025-01-09 00:06:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:06:15,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 931 [2025-01-09 00:06:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:15,243 INFO L225 Difference]: With dead ends: 87000 [2025-01-09 00:06:15,243 INFO L226 Difference]: Without dead ends: 47398 [2025-01-09 00:06:15,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 930 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:15,272 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 531 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:15,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 142 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:06:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47398 states. [2025-01-09 00:06:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47398 to 39006. [2025-01-09 00:06:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39006 states, 39005 states have (on average 1.0564543007306755) internal successors, (41207), 39005 states have internal predecessors, (41207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39006 states to 39006 states and 41207 transitions. [2025-01-09 00:06:15,802 INFO L78 Accepts]: Start accepts. Automaton has 39006 states and 41207 transitions. Word has length 931 [2025-01-09 00:06:15,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:15,803 INFO L471 AbstractCegarLoop]: Abstraction has 39006 states and 41207 transitions. [2025-01-09 00:06:15,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 39006 states and 41207 transitions. [2025-01-09 00:06:15,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1015 [2025-01-09 00:06:15,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:15,828 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:06:15,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 00:06:16,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 00:06:16,033 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:16,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1968758672, now seen corresponding path program 1 times [2025-01-09 00:06:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:16,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391989354] [2025-01-09 00:06:16,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:16,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1014 statements into 1 equivalence classes. [2025-01-09 00:06:16,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1014 of 1014 statements. [2025-01-09 00:06:16,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:16,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1062 proven. 105 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2025-01-09 00:06:17,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:17,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391989354] [2025-01-09 00:06:17,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391989354] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:06:17,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214486329] [2025-01-09 00:06:17,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:17,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:17,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:17,273 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:06:17,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:06:17,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1014 statements into 1 equivalence classes. [2025-01-09 00:06:17,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1014 of 1014 statements. [2025-01-09 00:06:17,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:17,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:17,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:06:17,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:06:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2025-01-09 00:06:17,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:06:17,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214486329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:17,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:06:17,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-01-09 00:06:17,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185675241] [2025-01-09 00:06:17,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:17,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:06:17,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:17,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:06:17,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:17,752 INFO L87 Difference]: Start difference. First operand 39006 states and 41207 transitions. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:19,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:19,171 INFO L93 Difference]: Finished difference Result 89991 states and 94674 transitions. [2025-01-09 00:06:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:06:19,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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 1014 [2025-01-09 00:06:19,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:19,229 INFO L225 Difference]: With dead ends: 89991 [2025-01-09 00:06:19,229 INFO L226 Difference]: Without dead ends: 50987 [2025-01-09 00:06:19,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 1013 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:19,253 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 568 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:19,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 138 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:06:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50987 states. [2025-01-09 00:06:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50987 to 42297. [2025-01-09 00:06:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42297 states, 42296 states have (on average 1.0536693777189332) internal successors, (44566), 42296 states have internal predecessors, (44566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42297 states to 42297 states and 44566 transitions. [2025-01-09 00:06:19,652 INFO L78 Accepts]: Start accepts. Automaton has 42297 states and 44566 transitions. Word has length 1014 [2025-01-09 00:06:19,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:19,653 INFO L471 AbstractCegarLoop]: Abstraction has 42297 states and 44566 transitions. [2025-01-09 00:06:19,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 42297 states and 44566 transitions. [2025-01-09 00:06:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2025-01-09 00:06:19,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:19,667 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:06:19,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 00:06:19,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 00:06:19,867 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:19,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash -953719709, now seen corresponding path program 1 times [2025-01-09 00:06:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:19,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007497485] [2025-01-09 00:06:19,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:19,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1052 statements into 1 equivalence classes. [2025-01-09 00:06:19,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1052 of 1052 statements. [2025-01-09 00:06:19,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:19,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 1164 proven. 39 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-01-09 00:06:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007497485] [2025-01-09 00:06:21,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007497485] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:06:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528040665] [2025-01-09 00:06:21,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:21,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:21,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:21,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:06:21,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 00:06:21,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1052 statements into 1 equivalence classes. [2025-01-09 00:06:21,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1052 of 1052 statements. [2025-01-09 00:06:21,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:21,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:21,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:06:21,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:06:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 1138 proven. 0 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2025-01-09 00:06:21,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:06:21,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528040665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:21,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:06:21,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:06:21,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066655629] [2025-01-09 00:06:21,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:21,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:21,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:21,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:21,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:21,782 INFO L87 Difference]: Start difference. First operand 42297 states and 44566 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:22,621 INFO L93 Difference]: Finished difference Result 83093 states and 87582 transitions. [2025-01-09 00:06:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:22,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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 1052 [2025-01-09 00:06:22,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:22,664 INFO L225 Difference]: With dead ends: 83093 [2025-01-09 00:06:22,664 INFO L226 Difference]: Without dead ends: 41396 [2025-01-09 00:06:22,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1054 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:22,692 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 131 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:22,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 529 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:06:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41396 states. [2025-01-09 00:06:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41396 to 39301.