./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-29.i -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 dddfc5942fec34b0a88732e75b6357bb86711b701ff81e97599587530ca1ca17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:56:41,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:56:41,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:56:41,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:56:41,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:56:41,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:56:41,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:56:41,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:56:41,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:56:41,291 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:56:41,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:56:41,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:56:41,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:56:41,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:56:41,293 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:56:41,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:56:41,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:56:41,294 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:56:41,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:56:41,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:56:41,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:56:41,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:56:41,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:56:41,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:56:41,295 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:56:41,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:56:41,295 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:56:41,295 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:56:41,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:56:41,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:56:41,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:56:41,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:56:41,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:41,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:56:41,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:56:41,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:56:41,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:56:41,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:56:41,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:56:41,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:56:41,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:56:41,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:56:41,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:56:41,297 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 -> dddfc5942fec34b0a88732e75b6357bb86711b701ff81e97599587530ca1ca17 [2025-02-05 21:56:41,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:56:41,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:56:41,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:56:41,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:56:41,549 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:56:41,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-29.i [2025-02-05 21:56:42,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/205366cef/bf4430c9b9e248e4b2c515682db52a29/FLAG3622f2ae3 [2025-02-05 21:56:43,255 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:56:43,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-29.i [2025-02-05 21:56:43,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/205366cef/bf4430c9b9e248e4b2c515682db52a29/FLAG3622f2ae3 [2025-02-05 21:56:43,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/205366cef/bf4430c9b9e248e4b2c515682db52a29 [2025-02-05 21:56:43,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:56:43,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:56:43,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:43,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:56:43,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:56:43,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:43,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d491be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43, skipping insertion in model container [2025-02-05 21:56:43,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:43,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:56:43,490 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-29.i[916,929] [2025-02-05 21:56:43,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:43,728 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:56:43,740 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-29.i[916,929] [2025-02-05 21:56:43,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:43,884 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:56:43,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43 WrapperNode [2025-02-05 21:56:43,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:43,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:43,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:56:43,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:56:43,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:43,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:44,006 INFO L138 Inliner]: procedures = 26, calls = 123, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 879 [2025-02-05 21:56:44,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:44,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:56:44,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:56:44,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:56:44,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:44,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:44,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:44,076 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-02-05 21:56:44,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:44,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:44,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:44,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:44,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:44,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:44,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:56:44,149 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:56:44,149 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:56:44,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:56:44,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:44,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:44,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:44,182 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-02-05 21:56:44,189 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-02-05 21:56:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:56:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:56:44,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:56:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:56:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:56:44,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:56:44,382 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:56:44,384 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:56:45,846 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 21:56:45,847 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:56:45,898 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:56:45,902 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:56:45,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:45 BoogieIcfgContainer [2025-02-05 21:56:45,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:56:45,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:56:45,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:56:45,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:56:45,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:56:43" (1/3) ... [2025-02-05 21:56:45,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6095c17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:45, skipping insertion in model container [2025-02-05 21:56:45,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (2/3) ... [2025-02-05 21:56:45,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6095c17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:45, skipping insertion in model container [2025-02-05 21:56:45,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:45" (3/3) ... [2025-02-05 21:56:45,913 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-29.i [2025-02-05 21:56:45,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:56:45,931 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-29.i that has 2 procedures, 362 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:56:46,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:56:46,016 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;@28b339ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:56:46,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:56:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 249 states have (on average 1.6104417670682731) internal successors, (401), 250 states have internal predecessors, (401), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:56:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:56:46,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:46,068 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:56:46,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:46,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash 511415449, now seen corresponding path program 1 times [2025-02-05 21:56:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:46,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465273644] [2025-02-05 21:56:46,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:46,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:56:46,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:56:46,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:46,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 218 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2025-02-05 21:56:46,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:46,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465273644] [2025-02-05 21:56:46,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465273644] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:56:46,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448818180] [2025-02-05 21:56:46,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:46,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:56:46,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:46,915 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-02-05 21:56:46,916 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-02-05 21:56:47,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:56:47,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:56:47,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:47,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:47,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 1590 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:56:47,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:56:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2025-02-05 21:56:47,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:56:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448818180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:47,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:56:47,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:56:47,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198771668] [2025-02-05 21:56:47,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:47,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:56:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:47,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:56:47,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:56:47,532 INFO L87 Difference]: Start difference. First operand has 362 states, 249 states have (on average 1.6104417670682731) internal successors, (401), 250 states have internal predecessors, (401), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2025-02-05 21:56:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:47,667 INFO L93 Difference]: Finished difference Result 718 states and 1347 transitions. [2025-02-05 21:56:47,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:56:47,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) Word has length 702 [2025-02-05 21:56:47,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:47,682 INFO L225 Difference]: With dead ends: 718 [2025-02-05 21:56:47,683 INFO L226 Difference]: Without dead ends: 359 [2025-02-05 21:56:47,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:56:47,694 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:47,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:47,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-05 21:56:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-02-05 21:56:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 247 states have (on average 1.5991902834008098) internal successors, (395), 247 states have internal predecessors, (395), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:56:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 615 transitions. [2025-02-05 21:56:47,801 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 615 transitions. Word has length 702 [2025-02-05 21:56:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:47,804 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 615 transitions. [2025-02-05 21:56:47,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2025-02-05 21:56:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 615 transitions. [2025-02-05 21:56:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:56:47,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:47,820 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:56:47,831 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-02-05 21:56:48,025 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,SelfDestructingSolverStorable0 [2025-02-05 21:56:48,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:48,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash 877734931, now seen corresponding path program 1 times [2025-02-05 21:56:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:48,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408088223] [2025-02-05 21:56:48,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:48,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:56:48,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:56:48,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:48,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:56:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408088223] [2025-02-05 21:56:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408088223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:48,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60054675] [2025-02-05 21:56:48,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:48,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:48,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:48,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:48,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:48,925 INFO L87 Difference]: Start difference. First operand 359 states and 615 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:49,101 INFO L93 Difference]: Finished difference Result 934 states and 1611 transitions. [2025-02-05 21:56:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:49,102 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-02-05 21:56:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:49,116 INFO L225 Difference]: With dead ends: 934 [2025-02-05 21:56:49,116 INFO L226 Difference]: Without dead ends: 578 [2025-02-05 21:56:49,118 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-02-05 21:56:49,120 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 381 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:49,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1258 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-05 21:56:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 575. [2025-02-05 21:56:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 432 states have (on average 1.650462962962963) internal successors, (713), 433 states have internal predecessors, (713), 140 states have call successors, (140), 2 states have call predecessors, (140), 2 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-02-05 21:56:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 993 transitions. [2025-02-05 21:56:49,240 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 993 transitions. Word has length 702 [2025-02-05 21:56:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:49,245 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 993 transitions. [2025-02-05 21:56:49,245 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 993 transitions. [2025-02-05 21:56:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:56:49,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:49,266 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:56:49,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:56:49,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:49,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash -331507308, now seen corresponding path program 1 times [2025-02-05 21:56:49,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:49,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323066443] [2025-02-05 21:56:49,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:49,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:49,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:56:49,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:56:49,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:49,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:56:49,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:49,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323066443] [2025-02-05 21:56:49,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323066443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:49,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:49,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429455163] [2025-02-05 21:56:49,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:49,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:49,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:49,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:49,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:49,733 INFO L87 Difference]: Start difference. First operand 575 states and 993 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:49,882 INFO L93 Difference]: Finished difference Result 1158 states and 1996 transitions. [2025-02-05 21:56:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:49,883 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-02-05 21:56:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:49,888 INFO L225 Difference]: With dead ends: 1158 [2025-02-05 21:56:49,889 INFO L226 Difference]: Without dead ends: 586 [2025-02-05 21:56:49,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:49,891 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 355 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:49,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1241 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-02-05 21:56:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 498. [2025-02-05 21:56:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 385 states have (on average 1.6623376623376624) internal successors, (640), 385 states have internal predecessors, (640), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:56:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 860 transitions. [2025-02-05 21:56:49,949 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 860 transitions. Word has length 702 [2025-02-05 21:56:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:49,953 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 860 transitions. [2025-02-05 21:56:49,953 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 860 transitions. [2025-02-05 21:56:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:56:49,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:49,970 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:56:49,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:56:49,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:49,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:49,971 INFO L85 PathProgramCache]: Analyzing trace with hash 80774355, now seen corresponding path program 1 times [2025-02-05 21:56:49,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:49,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997394698] [2025-02-05 21:56:49,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:49,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:50,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:56:50,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:56:50,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:50,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:56:50,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997394698] [2025-02-05 21:56:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997394698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:50,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:50,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:50,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745452624] [2025-02-05 21:56:50,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:50,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:50,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:50,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:50,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:50,344 INFO L87 Difference]: Start difference. First operand 498 states and 860 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:50,480 INFO L93 Difference]: Finished difference Result 1478 states and 2554 transitions. [2025-02-05 21:56:50,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:50,481 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-02-05 21:56:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:50,490 INFO L225 Difference]: With dead ends: 1478 [2025-02-05 21:56:50,491 INFO L226 Difference]: Without dead ends: 983 [2025-02-05 21:56:50,493 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-02-05 21:56:50,494 INFO L435 NwaCegarLoop]: 995 mSDtfsCounter, 599 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:50,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1574 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-02-05 21:56:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 724. [2025-02-05 21:56:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 611 states have (on average 1.7103109656301145) internal successors, (1045), 611 states have internal predecessors, (1045), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:56:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1265 transitions. [2025-02-05 21:56:50,566 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1265 transitions. Word has length 702 [2025-02-05 21:56:50,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:50,567 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1265 transitions. [2025-02-05 21:56:50,567 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1265 transitions. [2025-02-05 21:56:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:56:50,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:50,576 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:56:50,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:56:50,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:50,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1024342483, now seen corresponding path program 1 times [2025-02-05 21:56:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:50,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519312857] [2025-02-05 21:56:50,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:50,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:56:50,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:56:50,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:50,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:56:50,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519312857] [2025-02-05 21:56:50,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519312857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:50,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:50,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:50,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937475774] [2025-02-05 21:56:50,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:50,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:50,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:50,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:50,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:50,933 INFO L87 Difference]: Start difference. First operand 724 states and 1265 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:51,070 INFO L93 Difference]: Finished difference Result 1992 states and 3467 transitions. [2025-02-05 21:56:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:51,071 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-02-05 21:56:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:51,083 INFO L225 Difference]: With dead ends: 1992 [2025-02-05 21:56:51,084 INFO L226 Difference]: Without dead ends: 1271 [2025-02-05 21:56:51,086 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-02-05 21:56:51,086 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 515 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:51,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1177 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-02-05 21:56:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 848. [2025-02-05 21:56:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 735 states have (on average 1.7183673469387755) internal successors, (1263), 735 states have internal predecessors, (1263), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:56:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1483 transitions. [2025-02-05 21:56:51,144 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1483 transitions. Word has length 702 [2025-02-05 21:56:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:51,149 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1483 transitions. [2025-02-05 21:56:51,150 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1483 transitions. [2025-02-05 21:56:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:56:51,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:51,158 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:56:51,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:56:51,159 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:51,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:51,162 INFO L85 PathProgramCache]: Analyzing trace with hash 360781713, now seen corresponding path program 1 times [2025-02-05 21:56:51,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:51,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834903373] [2025-02-05 21:56:51,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:51,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:51,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:56:51,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:56:51,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:51,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:56:51,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:51,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834903373] [2025-02-05 21:56:51,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834903373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:51,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:51,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:51,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520362936] [2025-02-05 21:56:51,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:51,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:51,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:51,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:51,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:51,454 INFO L87 Difference]: Start difference. First operand 848 states and 1483 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:51,565 INFO L93 Difference]: Finished difference Result 2109 states and 3680 transitions. [2025-02-05 21:56:51,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:51,566 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-02-05 21:56:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:51,575 INFO L225 Difference]: With dead ends: 2109 [2025-02-05 21:56:51,575 INFO L226 Difference]: Without dead ends: 1264 [2025-02-05 21:56:51,577 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-02-05 21:56:51,578 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 264 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:51,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1174 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-02-05 21:56:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1261. [2025-02-05 21:56:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1088 states have (on average 1.703125) internal successors, (1853), 1089 states have internal predecessors, (1853), 168 states have call successors, (168), 4 states have call predecessors, (168), 4 states have return successors, (168), 167 states have call predecessors, (168), 168 states have call successors, (168) [2025-02-05 21:56:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 2189 transitions. [2025-02-05 21:56:51,630 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 2189 transitions. Word has length 702 [2025-02-05 21:56:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:51,631 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 2189 transitions. [2025-02-05 21:56:51,631 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 2189 transitions. [2025-02-05 21:56:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:56:51,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:51,638 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:56:51,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:56:51,639 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:51,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1028992723, now seen corresponding path program 1 times [2025-02-05 21:56:51,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:51,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236640758] [2025-02-05 21:56:51,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:51,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:51,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:56:51,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:56:51,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:51,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:56:52,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:52,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236640758] [2025-02-05 21:56:52,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236640758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:52,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:52,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:56:52,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601287211] [2025-02-05 21:56:52,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:52,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:56:52,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:52,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:56:52,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:56:52,514 INFO L87 Difference]: Start difference. First operand 1261 states and 2189 transitions. Second operand has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 2 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-02-05 21:56:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:55,258 INFO L93 Difference]: Finished difference Result 6947 states and 12073 transitions. [2025-02-05 21:56:55,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:56:55,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 2 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) Word has length 702 [2025-02-05 21:56:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:55,293 INFO L225 Difference]: With dead ends: 6947 [2025-02-05 21:56:55,293 INFO L226 Difference]: Without dead ends: 5689 [2025-02-05 21:56:55,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:56:55,302 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 4382 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 839 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4382 SdHoareTripleChecker+Valid, 3409 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 839 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:55,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4382 Valid, 3409 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [839 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 21:56:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5689 states. [2025-02-05 21:56:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5689 to 4695. [2025-02-05 21:56:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4695 states, 4150 states have (on average 1.7065060240963856) internal successors, (7082), 4156 states have internal predecessors, (7082), 526 states have call successors, (526), 18 states have call predecessors, (526), 18 states have return successors, (526), 520 states have call predecessors, (526), 526 states have call successors, (526) [2025-02-05 21:56:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 8134 transitions. [2025-02-05 21:56:55,623 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 8134 transitions. Word has length 702 [2025-02-05 21:56:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:55,624 INFO L471 AbstractCegarLoop]: Abstraction has 4695 states and 8134 transitions. [2025-02-05 21:56:55,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 2 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-02-05 21:56:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 8134 transitions. [2025-02-05 21:56:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:56:55,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:55,638 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:56:55,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:56:55,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:55,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash -778854798, now seen corresponding path program 1 times [2025-02-05 21:56:55,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:55,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749825950] [2025-02-05 21:56:55,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:55,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:56:55,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:56:55,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:55,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:56:56,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:56,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749825950] [2025-02-05 21:56:56,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749825950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:56,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:56,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:56,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007623059] [2025-02-05 21:56:56,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:56,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:56,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:56,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:56,281 INFO L87 Difference]: Start difference. First operand 4695 states and 8134 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:56,577 INFO L93 Difference]: Finished difference Result 14079 states and 24396 transitions. [2025-02-05 21:56:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:56,578 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-02-05 21:56:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:56,634 INFO L225 Difference]: With dead ends: 14079 [2025-02-05 21:56:56,634 INFO L226 Difference]: Without dead ends: 9387 [2025-02-05 21:56:56,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-05 21:56:56,649 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 357 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:56,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1181 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9387 states. [2025-02-05 21:56:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9387 to 9385. [2025-02-05 21:56:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9385 states, 8296 states have (on average 1.7058823529411764) internal successors, (14152), 8308 states have internal predecessors, (14152), 1052 states have call successors, (1052), 36 states have call predecessors, (1052), 36 states have return successors, (1052), 1040 states have call predecessors, (1052), 1052 states have call successors, (1052) [2025-02-05 21:56:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9385 states to 9385 states and 16256 transitions. [2025-02-05 21:56:57,259 INFO L78 Accepts]: Start accepts. Automaton has 9385 states and 16256 transitions. Word has length 702 [2025-02-05 21:56:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:57,260 INFO L471 AbstractCegarLoop]: Abstraction has 9385 states and 16256 transitions. [2025-02-05 21:56:57,261 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), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:56:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 9385 states and 16256 transitions. [2025-02-05 21:56:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:56:57,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:57,281 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:56:57,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:56:57,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:57,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash -750225647, now seen corresponding path program 1 times [2025-02-05 21:56:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:57,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009194056] [2025-02-05 21:56:57,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:57,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:57,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:56:57,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:56:57,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:57,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:56:58,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:58,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009194056] [2025-02-05 21:56:58,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009194056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:58,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:58,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:56:58,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28592034] [2025-02-05 21:56:58,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:58,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:56:58,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:58,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:56:58,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:56:58,123 INFO L87 Difference]: Start difference. First operand 9385 states and 16256 transitions. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:57:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:03,288 INFO L93 Difference]: Finished difference Result 68080 states and 117843 transitions. [2025-02-05 21:57:03,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 21:57:03,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-02-05 21:57:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:03,513 INFO L225 Difference]: With dead ends: 68080 [2025-02-05 21:57:03,513 INFO L226 Difference]: Without dead ends: 58698 [2025-02-05 21:57:03,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:57:03,571 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 3377 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 738 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3377 SdHoareTripleChecker+Valid, 4424 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 738 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:03,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3377 Valid, 4424 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [738 Valid, 1753 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 21:57:03,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58698 states. [2025-02-05 21:57:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58698 to 33821. [2025-02-05 21:57:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33821 states, 30643 states have (on average 1.7122670756779688) internal successors, (52469), 30701 states have internal predecessors, (52469), 2988 states have call successors, (2988), 189 states have call predecessors, (2988), 189 states have return successors, (2988), 2930 states have call predecessors, (2988), 2988 states have call successors, (2988) [2025-02-05 21:57:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33821 states to 33821 states and 58445 transitions. [2025-02-05 21:57:05,460 INFO L78 Accepts]: Start accepts. Automaton has 33821 states and 58445 transitions. Word has length 702 [2025-02-05 21:57:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:05,462 INFO L471 AbstractCegarLoop]: Abstraction has 33821 states and 58445 transitions. [2025-02-05 21:57:05,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:57:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 33821 states and 58445 transitions. [2025-02-05 21:57:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:57:05,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:05,507 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:57:05,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:57:05,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:05,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1932951693, now seen corresponding path program 1 times [2025-02-05 21:57:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:05,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818191806] [2025-02-05 21:57:05,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:05,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:05,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:57:05,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:57:05,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:05,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:57:06,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:06,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818191806] [2025-02-05 21:57:06,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818191806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:06,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:06,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:57:06,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765457155] [2025-02-05 21:57:06,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:06,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:57:06,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:06,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:57:06,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:57:06,087 INFO L87 Difference]: Start difference. First operand 33821 states and 58445 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-02-05 21:57:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:09,241 INFO L93 Difference]: Finished difference Result 88852 states and 153497 transitions. [2025-02-05 21:57:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:57:09,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) Word has length 702 [2025-02-05 21:57:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:09,421 INFO L225 Difference]: With dead ends: 88852 [2025-02-05 21:57:09,422 INFO L226 Difference]: Without dead ends: 55104 [2025-02-05 21:57:09,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:57:09,505 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1812 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1812 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:09,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1812 Valid, 3019 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 21:57:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55104 states. [2025-02-05 21:57:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55104 to 54027. [2025-02-05 21:57:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54027 states, 48838 states have (on average 1.7094475613251976) internal successors, (83486), 48933 states have internal predecessors, (83486), 4868 states have call successors, (4868), 320 states have call predecessors, (4868), 320 states have return successors, (4868), 4773 states have call predecessors, (4868), 4868 states have call successors, (4868) [2025-02-05 21:57:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54027 states to 54027 states and 93222 transitions. [2025-02-05 21:57:11,885 INFO L78 Accepts]: Start accepts. Automaton has 54027 states and 93222 transitions. Word has length 702 [2025-02-05 21:57:11,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:11,887 INFO L471 AbstractCegarLoop]: Abstraction has 54027 states and 93222 transitions. [2025-02-05 21:57:11,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-02-05 21:57:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 54027 states and 93222 transitions. [2025-02-05 21:57:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:57:11,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:11,937 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:57:11,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:57:11,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:11,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:11,939 INFO L85 PathProgramCache]: Analyzing trace with hash 554168082, now seen corresponding path program 1 times [2025-02-05 21:57:11,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:11,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726623673] [2025-02-05 21:57:11,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:11,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:11,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:57:12,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:57:12,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:12,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:57:13,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:13,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726623673] [2025-02-05 21:57:13,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726623673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:13,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:13,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:57:13,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676720716] [2025-02-05 21:57:13,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:13,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:57:13,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:13,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:57:13,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:57:13,252 INFO L87 Difference]: Start difference. First operand 54027 states and 93222 transitions. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:57:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:36,020 INFO L93 Difference]: Finished difference Result 530419 states and 899703 transitions. [2025-02-05 21:57:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 21:57:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-02-05 21:57:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:38,116 INFO L225 Difference]: With dead ends: 530419 [2025-02-05 21:57:38,116 INFO L226 Difference]: Without dead ends: 476493 [2025-02-05 21:57:38,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2025-02-05 21:57:38,311 INFO L435 NwaCegarLoop]: 1853 mSDtfsCounter, 5774 mSDsluCounter, 5391 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 959 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5774 SdHoareTripleChecker+Valid, 7244 SdHoareTripleChecker+Invalid, 3555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 959 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:38,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5774 Valid, 7244 Invalid, 3555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [959 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 21:57:38,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476493 states.