./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label39.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/Problem17_label39.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 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:14:02,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:14:02,091 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:14:02,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:14:02,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:14:02,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:14:02,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:14:02,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:14:02,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:14:02,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:14:02,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:14:02,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:14:02,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:14:02,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:14:02,122 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:14:02,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:14:02,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:14:02,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:14:02,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:14:02,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:14:02,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:14:02,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:14:02,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:14:02,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:14:02,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:14:02,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:14:02,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:14:02,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:14:02,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:14:02,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:14:02,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:14:02,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:14:02,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:02,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:02,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:14:02,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:14:02,125 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 -> 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c [2025-01-09 00:14:02,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:14:02,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:14:02,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:14:02,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:14:02,425 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:14:02,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2025-01-09 00:14:03,752 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ae104446/3300eb5774af4d0b946081e9dd9e3f00/FLAG2af5960f0 [2025-01-09 00:14:04,312 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:14:04,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2025-01-09 00:14:04,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ae104446/3300eb5774af4d0b946081e9dd9e3f00/FLAG2af5960f0 [2025-01-09 00:14:04,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ae104446/3300eb5774af4d0b946081e9dd9e3f00 [2025-01-09 00:14:04,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:14:04,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:14:04,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:14:04,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:14:04,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:14:04,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:14:04" (1/1) ... [2025-01-09 00:14:04,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a4c4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:04, skipping insertion in model container [2025-01-09 00:14:04,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:14:04" (1/1) ... [2025-01-09 00:14:04,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:14:04,677 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/Problem17_label39.c[9366,9379] [2025-01-09 00:14:05,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:14:05,146 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:14:05,167 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/Problem17_label39.c[9366,9379] [2025-01-09 00:14:05,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:14:05,433 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:14:05,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05 WrapperNode [2025-01-09 00:14:05,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:14:05,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:14:05,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:14:05,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:14:05,442 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:14:05" (1/1) ... [2025-01-09 00:14:05,487 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:14:05" (1/1) ... [2025-01-09 00:14:05,752 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:14:05,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:14:05,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:14:05,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:14:05,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:14:05,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (1/1) ... [2025-01-09 00:14:05,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (1/1) ... [2025-01-09 00:14:05,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (1/1) ... [2025-01-09 00:14:05,983 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:14:05,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (1/1) ... [2025-01-09 00:14:05,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (1/1) ... [2025-01-09 00:14:06,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (1/1) ... [2025-01-09 00:14:06,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (1/1) ... [2025-01-09 00:14:06,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (1/1) ... [2025-01-09 00:14:06,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (1/1) ... [2025-01-09 00:14:06,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (1/1) ... [2025-01-09 00:14:06,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:14:06,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:14:06,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:14:06,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:14:06,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (1/1) ... [2025-01-09 00:14:06,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:06,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:14:06,266 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:14:06,273 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:14:06,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:14:06,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:14:06,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:14:06,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:14:06,357 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:14:06,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:14:09,895 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:14:09,895 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:14:09,929 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:14:09,931 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:14:09,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:14:09 BoogieIcfgContainer [2025-01-09 00:14:09,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:14:09,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:14:09,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:14:09,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:14:09,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:14:04" (1/3) ... [2025-01-09 00:14:09,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8881a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:14:09, skipping insertion in model container [2025-01-09 00:14:09,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:05" (2/3) ... [2025-01-09 00:14:09,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8881a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:14:09, skipping insertion in model container [2025-01-09 00:14:09,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:14:09" (3/3) ... [2025-01-09 00:14:09,945 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label39.c [2025-01-09 00:14:09,960 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:14:09,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label39.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:14:10,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:14:10,044 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;@76916f15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:14:10,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:14:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 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:14:10,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 00:14:10,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:10,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:10,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:10,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:10,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1826551956, now seen corresponding path program 1 times [2025-01-09 00:14:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:10,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927566376] [2025-01-09 00:14:10,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:10,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:10,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 00:14:10,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 00:14:10,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:10,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:10,473 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:14:10,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:10,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927566376] [2025-01-09 00:14:10,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927566376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:10,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:10,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259040793] [2025-01-09 00:14:10,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:10,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:10,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:10,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:10,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:10,502 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:14:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:12,957 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-01-09 00:14:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:12,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-01-09 00:14:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:12,975 INFO L225 Difference]: With dead ends: 1644 [2025-01-09 00:14:12,976 INFO L226 Difference]: Without dead ends: 977 [2025-01-09 00:14:12,981 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:14:12,984 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 425 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:12,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:14:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-09 00:14:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-01-09 00:14:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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:14:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-01-09 00:14:13,075 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 63 [2025-01-09 00:14:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:13,075 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-01-09 00:14:13,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:14:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-01-09 00:14:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 00:14:13,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:13,082 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:13,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:14:13,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash -268098022, now seen corresponding path program 1 times [2025-01-09 00:14:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889913075] [2025-01-09 00:14:13,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:13,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 00:14:13,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 00:14:13,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:13,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:13,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:13,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889913075] [2025-01-09 00:14:13,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889913075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:13,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:13,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:13,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344011926] [2025-01-09 00:14:13,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:13,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:13,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:13,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:13,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:13,492 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:14:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:15,526 INFO L93 Difference]: Finished difference Result 2844 states and 4428 transitions. [2025-01-09 00:14:15,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:15,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-01-09 00:14:15,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:15,535 INFO L225 Difference]: With dead ends: 2844 [2025-01-09 00:14:15,535 INFO L226 Difference]: Without dead ends: 1875 [2025-01-09 00:14:15,537 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:14:15,538 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 444 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:15,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 240 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:14:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2025-01-09 00:14:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1854. [2025-01-09 00:14:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.489476524554776) internal successors, (2760), 1853 states have internal predecessors, (2760), 0 states have call successors, (0), 0 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:14:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2760 transitions. [2025-01-09 00:14:15,581 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2760 transitions. Word has length 130 [2025-01-09 00:14:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:15,581 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2760 transitions. [2025-01-09 00:14:15,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:14:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2760 transitions. [2025-01-09 00:14:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 00:14:15,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:15,584 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:15,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:14:15,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:15,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:15,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1797563903, now seen corresponding path program 1 times [2025-01-09 00:14:15,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:15,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2588746] [2025-01-09 00:14:15,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:15,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:15,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 00:14:15,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 00:14:15,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:15,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:15,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:15,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2588746] [2025-01-09 00:14:15,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2588746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:15,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:15,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:15,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870549441] [2025-01-09 00:14:15,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:15,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:15,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:15,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:15,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:15,885 INFO L87 Difference]: Start difference. First operand 1854 states and 2760 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:14:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:18,049 INFO L93 Difference]: Finished difference Result 4574 states and 7028 transitions. [2025-01-09 00:14:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:18,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-01-09 00:14:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:18,063 INFO L225 Difference]: With dead ends: 4574 [2025-01-09 00:14:18,063 INFO L226 Difference]: Without dead ends: 2722 [2025-01-09 00:14:18,067 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:14:18,068 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 429 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:18,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 919 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:14:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2025-01-09 00:14:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2720. [2025-01-09 00:14:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2720 states, 2719 states have (on average 1.4133872747333578) internal successors, (3843), 2719 states have internal predecessors, (3843), 0 states have call successors, (0), 0 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:14:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 3843 transitions. [2025-01-09 00:14:18,125 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 3843 transitions. Word has length 133 [2025-01-09 00:14:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:18,126 INFO L471 AbstractCegarLoop]: Abstraction has 2720 states and 3843 transitions. [2025-01-09 00:14:18,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:14:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 3843 transitions. [2025-01-09 00:14:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 00:14:18,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:18,132 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:18,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:14:18,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:18,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash -518385692, now seen corresponding path program 1 times [2025-01-09 00:14:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:18,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257149692] [2025-01-09 00:14:18,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:18,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:18,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 00:14:18,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 00:14:18,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:18,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257149692] [2025-01-09 00:14:18,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257149692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:18,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:18,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:18,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223681019] [2025-01-09 00:14:18,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:18,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:18,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:18,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:18,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:18,346 INFO L87 Difference]: Start difference. First operand 2720 states and 3843 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:14:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:20,299 INFO L93 Difference]: Finished difference Result 8021 states and 11343 transitions. [2025-01-09 00:14:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:20,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-01-09 00:14:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:20,320 INFO L225 Difference]: With dead ends: 8021 [2025-01-09 00:14:20,320 INFO L226 Difference]: Without dead ends: 5303 [2025-01-09 00:14:20,326 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:14:20,327 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 400 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:20,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:14:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2025-01-09 00:14:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 5299. [2025-01-09 00:14:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5298 states have (on average 1.2655719139297847) internal successors, (6705), 5298 states have internal predecessors, (6705), 0 states have call successors, (0), 0 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:14:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 6705 transitions. [2025-01-09 00:14:20,442 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 6705 transitions. Word has length 135 [2025-01-09 00:14:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:20,442 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 6705 transitions. [2025-01-09 00:14:20,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:14:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 6705 transitions. [2025-01-09 00:14:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 00:14:20,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:20,448 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, 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] [2025-01-09 00:14:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:14:20,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1897502892, now seen corresponding path program 1 times [2025-01-09 00:14:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:20,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501472856] [2025-01-09 00:14:20,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:20,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 00:14:20,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 00:14:20,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:20,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 00:14:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:20,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501472856] [2025-01-09 00:14:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501472856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045710240] [2025-01-09 00:14:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:20,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:20,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:20,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:20,710 INFO L87 Difference]: Start difference. First operand 5299 states and 6705 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:14:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:22,566 INFO L93 Difference]: Finished difference Result 15280 states and 19390 transitions. [2025-01-09 00:14:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:22,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 202 [2025-01-09 00:14:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:22,591 INFO L225 Difference]: With dead ends: 15280 [2025-01-09 00:14:22,592 INFO L226 Difference]: Without dead ends: 8704 [2025-01-09 00:14:22,600 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:14:22,603 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:22,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:14:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8704 states. [2025-01-09 00:14:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8704 to 7004. [2025-01-09 00:14:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7004 states, 7003 states have (on average 1.1552191917749537) internal successors, (8090), 7003 states have internal predecessors, (8090), 0 states have call successors, (0), 0 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:14:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7004 states to 7004 states and 8090 transitions. [2025-01-09 00:14:22,732 INFO L78 Accepts]: Start accepts. Automaton has 7004 states and 8090 transitions. Word has length 202 [2025-01-09 00:14:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:22,733 INFO L471 AbstractCegarLoop]: Abstraction has 7004 states and 8090 transitions. [2025-01-09 00:14:22,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:14:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 7004 states and 8090 transitions. [2025-01-09 00:14:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 00:14:22,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:22,738 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, 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] [2025-01-09 00:14:22,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:14:22,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:22,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:22,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1179346121, now seen corresponding path program 1 times [2025-01-09 00:14:22,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:22,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585134836] [2025-01-09 00:14:22,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:22,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 00:14:22,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 00:14:22,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:22,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585134836] [2025-01-09 00:14:22,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585134836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:22,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:22,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171295088] [2025-01-09 00:14:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:22,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:22,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:22,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:22,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:22,981 INFO L87 Difference]: Start difference. First operand 7004 states and 8090 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 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:14:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:24,526 INFO L93 Difference]: Finished difference Result 17838 states and 20943 transitions. [2025-01-09 00:14:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:24,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2025-01-09 00:14:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:24,552 INFO L225 Difference]: With dead ends: 17838 [2025-01-09 00:14:24,553 INFO L226 Difference]: Without dead ends: 10836 [2025-01-09 00:14:24,559 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:14:24,560 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:24,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 779 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:14:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10836 states. [2025-01-09 00:14:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10836 to 10411. [2025-01-09 00:14:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10411 states, 10410 states have (on average 1.1472622478386167) internal successors, (11943), 10410 states have internal predecessors, (11943), 0 states have call successors, (0), 0 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:14:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10411 states to 10411 states and 11943 transitions. [2025-01-09 00:14:24,707 INFO L78 Accepts]: Start accepts. Automaton has 10411 states and 11943 transitions. Word has length 215 [2025-01-09 00:14:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:24,707 INFO L471 AbstractCegarLoop]: Abstraction has 10411 states and 11943 transitions. [2025-01-09 00:14:24,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 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:14:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 10411 states and 11943 transitions. [2025-01-09 00:14:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 00:14:24,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:24,710 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, 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] [2025-01-09 00:14:24,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:14:24,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:24,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:24,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1406770062, now seen corresponding path program 1 times [2025-01-09 00:14:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952976063] [2025-01-09 00:14:24,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:24,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 00:14:24,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 00:14:24,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:24,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:14:24,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952976063] [2025-01-09 00:14:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952976063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:24,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:24,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:24,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363624702] [2025-01-09 00:14:24,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:24,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:24,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:24,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:24,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:24,862 INFO L87 Difference]: Start difference. First operand 10411 states and 11943 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:14:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:26,379 INFO L93 Difference]: Finished difference Result 25914 states and 29669 transitions. [2025-01-09 00:14:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-01-09 00:14:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:26,418 INFO L225 Difference]: With dead ends: 25914 [2025-01-09 00:14:26,419 INFO L226 Difference]: Without dead ends: 15504 [2025-01-09 00:14:26,431 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:14:26,432 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 390 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:26,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 439 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:14:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15504 states. [2025-01-09 00:14:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15504 to 10377. [2025-01-09 00:14:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10377 states, 10376 states have (on average 1.1462027756360833) internal successors, (11893), 10376 states have internal predecessors, (11893), 0 states have call successors, (0), 0 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:14:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 11893 transitions. [2025-01-09 00:14:26,578 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 11893 transitions. Word has length 217 [2025-01-09 00:14:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:26,579 INFO L471 AbstractCegarLoop]: Abstraction has 10377 states and 11893 transitions. [2025-01-09 00:14:26,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:14:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 11893 transitions. [2025-01-09 00:14:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 00:14:26,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:26,584 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:26,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:14:26,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:26,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:26,586 INFO L85 PathProgramCache]: Analyzing trace with hash -883992724, now seen corresponding path program 1 times [2025-01-09 00:14:26,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:26,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744222266] [2025-01-09 00:14:26,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:26,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 00:14:26,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 00:14:26,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:26,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-09 00:14:26,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:26,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744222266] [2025-01-09 00:14:26,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744222266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:26,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:26,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:26,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691637045] [2025-01-09 00:14:26,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:26,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:26,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:26,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:26,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:26,785 INFO L87 Difference]: Start difference. First operand 10377 states and 11893 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:14:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:28,433 INFO L93 Difference]: Finished difference Result 25412 states and 29358 transitions. [2025-01-09 00:14:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:28,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 295 [2025-01-09 00:14:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:28,462 INFO L225 Difference]: With dead ends: 25412 [2025-01-09 00:14:28,462 INFO L226 Difference]: Without dead ends: 13762 [2025-01-09 00:14:28,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:28,472 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 386 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:28,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 839 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:14:28,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13762 states. [2025-01-09 00:14:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13762 to 13762. [2025-01-09 00:14:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13762 states, 13761 states have (on average 1.1135818617833007) internal successors, (15324), 13761 states have internal predecessors, (15324), 0 states have call successors, (0), 0 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:14:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13762 states to 13762 states and 15324 transitions. [2025-01-09 00:14:28,629 INFO L78 Accepts]: Start accepts. Automaton has 13762 states and 15324 transitions. Word has length 295 [2025-01-09 00:14:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:28,629 INFO L471 AbstractCegarLoop]: Abstraction has 13762 states and 15324 transitions. [2025-01-09 00:14:28,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:14:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 13762 states and 15324 transitions. [2025-01-09 00:14:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-09 00:14:28,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:28,639 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:28,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:14:28,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:28,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash 976532295, now seen corresponding path program 1 times [2025-01-09 00:14:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:28,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353928627] [2025-01-09 00:14:28,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:28,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:28,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 00:14:28,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 00:14:28,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:28,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:29,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353928627] [2025-01-09 00:14:29,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353928627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:29,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:29,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:14:29,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036972686] [2025-01-09 00:14:29,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:29,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:14:29,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:29,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:14:29,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:14:29,116 INFO L87 Difference]: Start difference. First operand 13762 states and 15324 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 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:14:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:31,829 INFO L93 Difference]: Finished difference Result 38619 states and 43031 transitions. [2025-01-09 00:14:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:14:31,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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 335 [2025-01-09 00:14:31,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:31,890 INFO L225 Difference]: With dead ends: 38619 [2025-01-09 00:14:31,890 INFO L226 Difference]: Without dead ends: 24859 [2025-01-09 00:14:31,906 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:14:31,907 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 850 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:31,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 183 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 00:14:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24859 states. [2025-01-09 00:14:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24859 to 21868. [2025-01-09 00:14:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21868 states, 21867 states have (on average 1.1193122056066218) internal successors, (24476), 21867 states have internal predecessors, (24476), 0 states have call successors, (0), 0 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:14:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21868 states to 21868 states and 24476 transitions. [2025-01-09 00:14:32,184 INFO L78 Accepts]: Start accepts. Automaton has 21868 states and 24476 transitions. Word has length 335 [2025-01-09 00:14:32,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:32,184 INFO L471 AbstractCegarLoop]: Abstraction has 21868 states and 24476 transitions. [2025-01-09 00:14:32,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 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:14:32,185 INFO L276 IsEmpty]: Start isEmpty. Operand 21868 states and 24476 transitions. [2025-01-09 00:14:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-09 00:14:32,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:32,193 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:32,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:14:32,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:32,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash -11341496, now seen corresponding path program 1 times [2025-01-09 00:14:32,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:32,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686163320] [2025-01-09 00:14:32,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:32,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:32,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 00:14:32,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 00:14:32,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:32,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:14:32,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686163320] [2025-01-09 00:14:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686163320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:32,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:32,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:32,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28042972] [2025-01-09 00:14:32,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:32,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:32,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:32,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:32,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:32,507 INFO L87 Difference]: Start difference. First operand 21868 states and 24476 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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:14:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:34,335 INFO L93 Difference]: Finished difference Result 51435 states and 57667 transitions. [2025-01-09 00:14:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:34,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 352 [2025-01-09 00:14:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:34,382 INFO L225 Difference]: With dead ends: 51435 [2025-01-09 00:14:34,383 INFO L226 Difference]: Without dead ends: 29569 [2025-01-09 00:14:34,402 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:14:34,402 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 438 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:34,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 807 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:14:34,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29569 states. [2025-01-09 00:14:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29569 to 28696. [2025-01-09 00:14:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28696 states, 28695 states have (on average 1.1108207004704653) internal successors, (31875), 28695 states have internal predecessors, (31875), 0 states have call successors, (0), 0 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:14:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28696 states to 28696 states and 31875 transitions. [2025-01-09 00:14:34,713 INFO L78 Accepts]: Start accepts. Automaton has 28696 states and 31875 transitions. Word has length 352 [2025-01-09 00:14:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:34,714 INFO L471 AbstractCegarLoop]: Abstraction has 28696 states and 31875 transitions. [2025-01-09 00:14:34,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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:14:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 28696 states and 31875 transitions. [2025-01-09 00:14:34,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-01-09 00:14:34,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:34,722 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, 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, 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] [2025-01-09 00:14:34,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:14:34,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:34,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:34,723 INFO L85 PathProgramCache]: Analyzing trace with hash -724127610, now seen corresponding path program 1 times [2025-01-09 00:14:34,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:34,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315329563] [2025-01-09 00:14:34,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:34,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:34,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-01-09 00:14:34,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-01-09 00:14:34,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:34,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-01-09 00:14:35,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:35,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315329563] [2025-01-09 00:14:35,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315329563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:35,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:35,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:35,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882885901] [2025-01-09 00:14:35,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:35,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:35,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:35,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:35,170 INFO L87 Difference]: Start difference. First operand 28696 states and 31875 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:14:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:36,874 INFO L93 Difference]: Finished difference Result 68042 states and 75585 transitions. [2025-01-09 00:14:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:36,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 378 [2025-01-09 00:14:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:36,921 INFO L225 Difference]: With dead ends: 68042 [2025-01-09 00:14:36,921 INFO L226 Difference]: Without dead ends: 39348 [2025-01-09 00:14:36,946 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:14:36,947 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 463 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:36,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 189 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:14:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39348 states. [2025-01-09 00:14:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39348 to 35487. [2025-01-09 00:14:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35487 states, 35486 states have (on average 1.1153412613425013) internal successors, (39579), 35486 states have internal predecessors, (39579), 0 states have call successors, (0), 0 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:14:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35487 states to 35487 states and 39579 transitions. [2025-01-09 00:14:37,492 INFO L78 Accepts]: Start accepts. Automaton has 35487 states and 39579 transitions. Word has length 378 [2025-01-09 00:14:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:37,492 INFO L471 AbstractCegarLoop]: Abstraction has 35487 states and 39579 transitions. [2025-01-09 00:14:37,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:14:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 35487 states and 39579 transitions. [2025-01-09 00:14:37,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-01-09 00:14:37,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:37,502 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:37,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:14:37,503 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:37,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1925992636, now seen corresponding path program 1 times [2025-01-09 00:14:37,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:37,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003336643] [2025-01-09 00:14:37,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:37,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:37,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-01-09 00:14:37,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-09 00:14:37,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:37,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:37,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003336643] [2025-01-09 00:14:37,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003336643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:37,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:37,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:37,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065781487] [2025-01-09 00:14:37,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:37,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:14:37,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:37,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:14:37,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:14:37,817 INFO L87 Difference]: Start difference. First operand 35487 states and 39579 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:39,982 INFO L93 Difference]: Finished difference Result 87184 states and 97377 transitions. [2025-01-09 00:14:39,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:14:39,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 402 [2025-01-09 00:14:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:40,049 INFO L225 Difference]: With dead ends: 87184 [2025-01-09 00:14:40,049 INFO L226 Difference]: Without dead ends: 50849 [2025-01-09 00:14:40,080 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:14:40,081 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 613 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:40,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 207 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 2371 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:14:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50849 states. [2025-01-09 00:14:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50849 to 50847. [2025-01-09 00:14:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50847 states, 50846 states have (on average 1.1196554301223303) internal successors, (56930), 50846 states have internal predecessors, (56930), 0 states have call successors, (0), 0 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:14:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50847 states to 50847 states and 56930 transitions. [2025-01-09 00:14:40,739 INFO L78 Accepts]: Start accepts. Automaton has 50847 states and 56930 transitions. Word has length 402 [2025-01-09 00:14:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:40,740 INFO L471 AbstractCegarLoop]: Abstraction has 50847 states and 56930 transitions. [2025-01-09 00:14:40,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 50847 states and 56930 transitions. [2025-01-09 00:14:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-01-09 00:14:40,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:40,761 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:14:40,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:14:40,761 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:40,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:40,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1369909181, now seen corresponding path program 1 times [2025-01-09 00:14:40,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:40,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102559607] [2025-01-09 00:14:40,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:40,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:40,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-01-09 00:14:40,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-01-09 00:14:40,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:40,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 00:14:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:40,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102559607] [2025-01-09 00:14:40,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102559607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:40,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:40,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203794069] [2025-01-09 00:14:40,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:40,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:40,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:40,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:40,999 INFO L87 Difference]: Start difference. First operand 50847 states and 56930 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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:14:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:42,797 INFO L93 Difference]: Finished difference Result 110203 states and 124003 transitions. [2025-01-09 00:14:42,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:42,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 525 [2025-01-09 00:14:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:42,856 INFO L225 Difference]: With dead ends: 110203 [2025-01-09 00:14:42,856 INFO L226 Difference]: Without dead ends: 57652 [2025-01-09 00:14:42,893 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:14:42,893 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 416 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:42,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 770 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:14:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57652 states. [2025-01-09 00:14:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57652 to 57650. [2025-01-09 00:14:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57650 states, 57649 states have (on average 1.1105136255615882) internal successors, (64020), 57649 states have internal predecessors, (64020), 0 states have call successors, (0), 0 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:14:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57650 states to 57650 states and 64020 transitions. [2025-01-09 00:14:43,612 INFO L78 Accepts]: Start accepts. Automaton has 57650 states and 64020 transitions. Word has length 525 [2025-01-09 00:14:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:43,613 INFO L471 AbstractCegarLoop]: Abstraction has 57650 states and 64020 transitions. [2025-01-09 00:14:43,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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:14:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 57650 states and 64020 transitions. [2025-01-09 00:14:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 00:14:43,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:43,641 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:43,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:14:43,641 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:43,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash -187847605, now seen corresponding path program 1 times [2025-01-09 00:14:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:43,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987064602] [2025-01-09 00:14:43,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:43,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 00:14:43,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 00:14:43,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:43,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:44,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987064602] [2025-01-09 00:14:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987064602] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:14:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872162990] [2025-01-09 00:14:44,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:44,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:14:44,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:14:44,552 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:14:44,553 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:14:44,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 00:14:44,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 00:14:44,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:44,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:44,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:14:44,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:14:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:45,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:14:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:46,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872162990] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:14:46,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:14:46,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2025-01-09 00:14:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123455097] [2025-01-09 00:14:46,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:46,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:14:46,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:46,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:14:46,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:14:46,276 INFO L87 Difference]: Start difference. First operand 57650 states and 64020 transitions. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:49,727 INFO L93 Difference]: Finished difference Result 167301 states and 186385 transitions. [2025-01-09 00:14:49,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:14:49,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 548 [2025-01-09 00:14:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:49,888 INFO L225 Difference]: With dead ends: 167301 [2025-01-09 00:14:49,888 INFO L226 Difference]: Without dead ends: 106675 [2025-01-09 00:14:49,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1098 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:14:49,938 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 935 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3228 mSolverCounterSat, 612 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 3840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 612 IncrementalHoareTripleChecker+Valid, 3228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:49,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 233 Invalid, 3840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [612 Valid, 3228 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 00:14:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106675 states. [2025-01-09 00:14:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106675 to 86217. [2025-01-09 00:14:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86217 states, 86216 states have (on average 1.1080425907024218) internal successors, (95531), 86216 states have internal predecessors, (95531), 0 states have call successors, (0), 0 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:14:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86217 states to 86217 states and 95531 transitions. [2025-01-09 00:14:50,946 INFO L78 Accepts]: Start accepts. Automaton has 86217 states and 95531 transitions. Word has length 548 [2025-01-09 00:14:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:50,946 INFO L471 AbstractCegarLoop]: Abstraction has 86217 states and 95531 transitions. [2025-01-09 00:14:50,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 86217 states and 95531 transitions. [2025-01-09 00:14:50,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-01-09 00:14:50,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:50,969 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:14:50,978 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:14:51,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 00:14:51,171 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:51,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:51,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1323066068, now seen corresponding path program 1 times [2025-01-09 00:14:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013292662] [2025-01-09 00:14:51,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:51,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 00:14:51,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 00:14:51,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:51,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-01-09 00:14:51,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:51,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013292662] [2025-01-09 00:14:51,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013292662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:51,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:51,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:51,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885968245] [2025-01-09 00:14:51,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:51,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:51,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:51,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:51,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:51,380 INFO L87 Difference]: Start difference. First operand 86217 states and 95531 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:14:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:53,327 INFO L93 Difference]: Finished difference Result 186039 states and 206324 transitions. [2025-01-09 00:14:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:53,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 577 [2025-01-09 00:14:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:53,445 INFO L225 Difference]: With dead ends: 186039 [2025-01-09 00:14:53,445 INFO L226 Difference]: Without dead ends: 94703 [2025-01-09 00:14:53,505 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:14:53,506 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 435 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:53,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 720 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:14:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94703 states. [2025-01-09 00:14:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94703 to 94688. [2025-01-09 00:14:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94688 states, 94687 states have (on average 1.0952929124378215) internal successors, (103710), 94687 states have internal predecessors, (103710), 0 states have call successors, (0), 0 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:14:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94688 states to 94688 states and 103710 transitions. [2025-01-09 00:14:54,636 INFO L78 Accepts]: Start accepts. Automaton has 94688 states and 103710 transitions. Word has length 577 [2025-01-09 00:14:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:54,636 INFO L471 AbstractCegarLoop]: Abstraction has 94688 states and 103710 transitions. [2025-01-09 00:14:54,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:14:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 94688 states and 103710 transitions. [2025-01-09 00:14:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 745 [2025-01-09 00:14:54,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:54,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, 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, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:14:54,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:14:54,667 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:54,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1522023288, now seen corresponding path program 1 times [2025-01-09 00:14:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292983040] [2025-01-09 00:14:54,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:54,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 744 statements into 1 equivalence classes. [2025-01-09 00:14:54,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 744 of 744 statements. [2025-01-09 00:14:54,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:54,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1419 backedges. 860 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-01-09 00:14:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:55,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292983040] [2025-01-09 00:14:55,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292983040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:55,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:55,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:55,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532440456] [2025-01-09 00:14:55,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:55,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:55,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:55,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:55,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:55,032 INFO L87 Difference]: Start difference. First operand 94688 states and 103710 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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:14:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:57,429 INFO L93 Difference]: Finished difference Result 196624 states and 215179 transitions. [2025-01-09 00:14:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:57,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 744 [2025-01-09 00:14:57,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:57,543 INFO L225 Difference]: With dead ends: 196624 [2025-01-09 00:14:57,543 INFO L226 Difference]: Without dead ends: 101938 [2025-01-09 00:14:57,575 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:14:57,575 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 486 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:57,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 246 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:14:57,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101938 states. [2025-01-09 00:14:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101938 to 88270. [2025-01-09 00:14:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88270 states, 88269 states have (on average 1.090790651304535) internal successors, (96283), 88269 states have internal predecessors, (96283), 0 states have call successors, (0), 0 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:14:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88270 states to 88270 states and 96283 transitions. [2025-01-09 00:14:58,808 INFO L78 Accepts]: Start accepts. Automaton has 88270 states and 96283 transitions. Word has length 744 [2025-01-09 00:14:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:58,808 INFO L471 AbstractCegarLoop]: Abstraction has 88270 states and 96283 transitions. [2025-01-09 00:14:58,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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:14:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 88270 states and 96283 transitions. [2025-01-09 00:14:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2025-01-09 00:14:58,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:58,838 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:58,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:14:58,838 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:58,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1408943557, now seen corresponding path program 1 times [2025-01-09 00:14:58,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:58,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722807702] [2025-01-09 00:14:58,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:58,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:58,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-01-09 00:14:58,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-01-09 00:14:58,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:58,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-09 00:14:59,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:59,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722807702] [2025-01-09 00:14:59,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722807702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:59,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:59,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:59,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269902011] [2025-01-09 00:14:59,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:59,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:59,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:59,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:59,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:59,249 INFO L87 Difference]: Start difference. First operand 88270 states and 96283 transitions. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 2 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:15:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:00,168 INFO L93 Difference]: Finished difference Result 154343 states and 167701 transitions. [2025-01-09 00:15:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:00,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 2 states have internal predecessors, (536), 0 states have call successors, (0), 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 750 [2025-01-09 00:15:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:00,240 INFO L225 Difference]: With dead ends: 154343 [2025-01-09 00:15:00,240 INFO L226 Difference]: Without dead ends: 66074 [2025-01-09 00:15:00,287 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:15:00,288 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 567 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:00,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 73 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:15:00,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66074 states. [2025-01-09 00:15:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66074 to 64362. [2025-01-09 00:15:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64362 states, 64361 states have (on average 1.0811671664517333) internal successors, (69585), 64361 states have internal predecessors, (69585), 0 states have call successors, (0), 0 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:15:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64362 states to 64362 states and 69585 transitions. [2025-01-09 00:15:01,191 INFO L78 Accepts]: Start accepts. Automaton has 64362 states and 69585 transitions. Word has length 750 [2025-01-09 00:15:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:01,191 INFO L471 AbstractCegarLoop]: Abstraction has 64362 states and 69585 transitions. [2025-01-09 00:15:01,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 2 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:15:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 64362 states and 69585 transitions. [2025-01-09 00:15:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2025-01-09 00:15:01,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:01,238 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:01,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:15:01,238 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:01,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:01,239 INFO L85 PathProgramCache]: Analyzing trace with hash 661486988, now seen corresponding path program 1 times [2025-01-09 00:15:01,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:01,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247147491] [2025-01-09 00:15:01,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:01,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:01,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 797 statements into 1 equivalence classes. [2025-01-09 00:15:01,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 797 of 797 statements. [2025-01-09 00:15:01,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:01,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2025-01-09 00:15:01,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:01,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247147491] [2025-01-09 00:15:01,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247147491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:01,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:01,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:01,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679200283] [2025-01-09 00:15:01,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:01,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:01,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:01,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:01,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:01,822 INFO L87 Difference]: Start difference. First operand 64362 states and 69585 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 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:15:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:03,326 INFO L93 Difference]: Finished difference Result 134241 states and 145152 transitions. [2025-01-09 00:15:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:03,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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 797 [2025-01-09 00:15:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:03,410 INFO L225 Difference]: With dead ends: 134241 [2025-01-09 00:15:03,410 INFO L226 Difference]: Without dead ends: 67330 [2025-01-09 00:15:03,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:03,449 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 443 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:03,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 718 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:15:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67330 states. [2025-01-09 00:15:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67330 to 63502. [2025-01-09 00:15:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63502 states, 63501 states have (on average 1.0713847026031087) internal successors, (68034), 63501 states have internal predecessors, (68034), 0 states have call successors, (0), 0 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:15:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63502 states to 63502 states and 68034 transitions. [2025-01-09 00:15:04,095 INFO L78 Accepts]: Start accepts. Automaton has 63502 states and 68034 transitions. Word has length 797 [2025-01-09 00:15:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:04,096 INFO L471 AbstractCegarLoop]: Abstraction has 63502 states and 68034 transitions. [2025-01-09 00:15:04,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 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:15:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 63502 states and 68034 transitions. [2025-01-09 00:15:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2025-01-09 00:15:04,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:04,249 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:04,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:15:04,250 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2054463129, now seen corresponding path program 1 times [2025-01-09 00:15:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892931309] [2025-01-09 00:15:04,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:04,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 939 statements into 1 equivalence classes. [2025-01-09 00:15:04,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 939 of 939 statements. [2025-01-09 00:15:04,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:04,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 1154 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-01-09 00:15:05,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:05,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892931309] [2025-01-09 00:15:05,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892931309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:05,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:05,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:05,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389163104] [2025-01-09 00:15:05,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:05,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:05,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:05,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:05,146 INFO L87 Difference]: Start difference. First operand 63502 states and 68034 transitions. Second operand has 4 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 0 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:15:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:07,307 INFO L93 Difference]: Finished difference Result 131262 states and 140683 transitions. [2025-01-09 00:15:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:07,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 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 939 [2025-01-09 00:15:07,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:07,385 INFO L225 Difference]: With dead ends: 131262 [2025-01-09 00:15:07,385 INFO L226 Difference]: Without dead ends: 67762 [2025-01-09 00:15:07,429 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:15:07,429 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 653 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:07,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 130 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:15:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67762 states. [2025-01-09 00:15:08,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67762 to 62652. [2025-01-09 00:15:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62652 states, 62651 states have (on average 1.0699270562321432) internal successors, (67032), 62651 states have internal predecessors, (67032), 0 states have call successors, (0), 0 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:15:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62652 states to 62652 states and 67032 transitions. [2025-01-09 00:15:08,308 INFO L78 Accepts]: Start accepts. Automaton has 62652 states and 67032 transitions. Word has length 939 [2025-01-09 00:15:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:08,308 INFO L471 AbstractCegarLoop]: Abstraction has 62652 states and 67032 transitions. [2025-01-09 00:15:08,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 0 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:15:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 62652 states and 67032 transitions. [2025-01-09 00:15:08,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2025-01-09 00:15:08,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:08,349 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:08,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:15:08,349 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:08,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1373403291, now seen corresponding path program 1 times [2025-01-09 00:15:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:08,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836211812] [2025-01-09 00:15:08,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:08,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:08,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 955 statements into 1 equivalence classes. [2025-01-09 00:15:08,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 955 of 955 statements. [2025-01-09 00:15:08,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:08,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-01-09 00:15:09,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:09,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836211812] [2025-01-09 00:15:09,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836211812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:09,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:09,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:09,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23951662] [2025-01-09 00:15:09,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:09,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:09,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:09,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:09,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:09,283 INFO L87 Difference]: Start difference. First operand 62652 states and 67032 transitions. Second operand has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 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:15:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:11,452 INFO L93 Difference]: Finished difference Result 129111 states and 138133 transitions. [2025-01-09 00:15:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:11,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 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 955 [2025-01-09 00:15:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:11,530 INFO L225 Difference]: With dead ends: 129111 [2025-01-09 00:15:11,530 INFO L226 Difference]: Without dead ends: 66461 [2025-01-09 00:15:11,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:11,574 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 815 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:11,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 280 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:15:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66461 states. [2025-01-09 00:15:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66461 to 64329. [2025-01-09 00:15:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64329 states, 64328 states have (on average 1.0634094018156945) internal successors, (68407), 64328 states have internal predecessors, (68407), 0 states have call successors, (0), 0 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:15:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64329 states to 64329 states and 68407 transitions. [2025-01-09 00:15:12,420 INFO L78 Accepts]: Start accepts. Automaton has 64329 states and 68407 transitions. Word has length 955 [2025-01-09 00:15:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:12,420 INFO L471 AbstractCegarLoop]: Abstraction has 64329 states and 68407 transitions. [2025-01-09 00:15:12,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 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:15:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 64329 states and 68407 transitions. [2025-01-09 00:15:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 981 [2025-01-09 00:15:12,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:12,465 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:15:12,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:15:12,466 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:12,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:12,466 INFO L85 PathProgramCache]: Analyzing trace with hash -576620963, now seen corresponding path program 1 times [2025-01-09 00:15:12,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:12,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239470414] [2025-01-09 00:15:12,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:12,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:12,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 980 statements into 1 equivalence classes. [2025-01-09 00:15:12,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 980 of 980 statements. [2025-01-09 00:15:12,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:12,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 693 proven. 62 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:15:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239470414] [2025-01-09 00:15:13,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239470414] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449682171] [2025-01-09 00:15:13,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:13,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:13,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:13,336 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:15:13,338 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:15:13,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 980 statements into 1 equivalence classes. [2025-01-09 00:15:13,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 980 of 980 statements. [2025-01-09 00:15:13,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:13,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:13,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:15:13,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:15:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:15:15,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:15:15,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449682171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:15,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:15:15,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 00:15:15,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846862781] [2025-01-09 00:15:15,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:15,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:15,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:15,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:15:15,139 INFO L87 Difference]: Start difference. First operand 64329 states and 68407 transitions. Second operand has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 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:15:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:17,158 INFO L93 Difference]: Finished difference Result 122251 states and 129950 transitions. [2025-01-09 00:15:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:17,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 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 980 [2025-01-09 00:15:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:17,160 INFO L225 Difference]: With dead ends: 122251 [2025-01-09 00:15:17,160 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:15:17,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 983 GetRequests, 979 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:15:17,203 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 461 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:17,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 710 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:15:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:15:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:15:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:15:17,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 980 [2025-01-09 00:15:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:17,205 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:15:17,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 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:15:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:15:17,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:15:17,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:15:17,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:15:17,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:17,413 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:17,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.