./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cec5185ce7c24944b55ad80283733eba2f5aa0d5d2e63517a5d5bc6bcf21ed8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:49:01,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:49:01,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:49:01,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:49:01,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:49:01,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:49:01,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:49:01,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:49:01,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:49:01,271 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:49:01,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:49:01,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:49:01,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:49:01,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:49:01,272 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:49:01,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:49:01,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:49:01,273 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:49:01,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:49:01,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:49:01,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:49:01,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:49:01,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:49:01,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:49:01,273 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:49:01,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:49:01,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:49:01,274 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:49:01,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:49:01,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:49:01,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:49:01,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:49:01,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:49:01,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:49:01,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:49:01,275 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:49:01,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:49:01,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:49:01,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:49:01,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:49:01,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:49:01,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:49:01,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:49:01,275 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cec5185ce7c24944b55ad80283733eba2f5aa0d5d2e63517a5d5bc6bcf21ed8e [2025-03-03 19:49:01,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:49:01,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:49:01,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:49:01,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:49:01,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:49:01,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-6.i [2025-03-03 19:49:02,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9353e5e9f/84c3c3ea22b44cb892314264917bdaeb/FLAG79b5f8fd8 [2025-03-03 19:49:02,888 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:49:02,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-6.i [2025-03-03 19:49:02,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9353e5e9f/84c3c3ea22b44cb892314264917bdaeb/FLAG79b5f8fd8 [2025-03-03 19:49:02,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9353e5e9f/84c3c3ea22b44cb892314264917bdaeb [2025-03-03 19:49:02,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:49:02,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:49:02,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:49:02,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:49:02,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:49:02,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:49:02" (1/1) ... [2025-03-03 19:49:02,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02, skipping insertion in model container [2025-03-03 19:49:02,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:49:02" (1/1) ... [2025-03-03 19:49:02,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:49:03,055 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-6.i[915,928] [2025-03-03 19:49:03,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:49:03,183 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:49:03,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-6.i[915,928] [2025-03-03 19:49:03,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:49:03,271 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:49:03,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03 WrapperNode [2025-03-03 19:49:03,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:49:03,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:49:03,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:49:03,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:49:03,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,321 INFO L138 Inliner]: procedures = 26, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2025-03-03 19:49:03,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:49:03,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:49:03,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:49:03,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:49:03,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,372 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:49:03,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,395 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:49:03,414 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:49:03,415 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:49:03,415 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:49:03,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (1/1) ... [2025-03-03 19:49:03,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:49:03,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:03,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:49:03,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:49:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:49:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:49:03,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:49:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:49:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:49:03,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:49:03,553 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:49:03,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:49:04,128 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 19:49:04,129 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:49:04,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:49:04,152 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:49:04,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:49:04 BoogieIcfgContainer [2025-03-03 19:49:04,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:49:04,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:49:04,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:49:04,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:49:04,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:49:02" (1/3) ... [2025-03-03 19:49:04,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5441222a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:49:04, skipping insertion in model container [2025-03-03 19:49:04,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:03" (2/3) ... [2025-03-03 19:49:04,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5441222a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:49:04, skipping insertion in model container [2025-03-03 19:49:04,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:49:04" (3/3) ... [2025-03-03 19:49:04,163 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-6.i [2025-03-03 19:49:04,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:49:04,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-6.i that has 2 procedures, 216 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:49:04,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:49:04,237 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;@398ded6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:49:04,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:49:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 143 states have internal predecessors, (216), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-03 19:49:04,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-03 19:49:04,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:04,263 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:04,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:04,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:04,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1010758029, now seen corresponding path program 1 times [2025-03-03 19:49:04,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:04,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508952931] [2025-03-03 19:49:04,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:04,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-03 19:49:04,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-03 19:49:04,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:04,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-03-03 19:49:04,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:04,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508952931] [2025-03-03 19:49:04,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508952931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:04,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695029853] [2025-03-03 19:49:04,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:04,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:04,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:04,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:49:04,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:49:04,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-03 19:49:04,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-03 19:49:04,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:04,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:04,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:49:04,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:49:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-03-03 19:49:05,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:49:05,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695029853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:05,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:49:05,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:49:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144550667] [2025-03-03 19:49:05,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:05,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:49:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:05,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:49:05,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:49:05,060 INFO L87 Difference]: Start difference. First operand has 216 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 143 states have internal predecessors, (216), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-03-03 19:49:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:05,115 INFO L93 Difference]: Finished difference Result 426 states and 782 transitions. [2025-03-03 19:49:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:49:05,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) Word has length 448 [2025-03-03 19:49:05,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:05,125 INFO L225 Difference]: With dead ends: 426 [2025-03-03 19:49:05,126 INFO L226 Difference]: Without dead ends: 213 [2025-03-03 19:49:05,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 449 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-03-03 19:49:05,135 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:05,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-03 19:49:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-03-03 19:49:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 140 states have internal predecessors, (207), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-03 19:49:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 349 transitions. [2025-03-03 19:49:05,198 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 349 transitions. Word has length 448 [2025-03-03 19:49:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:05,199 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 349 transitions. [2025-03-03 19:49:05,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-03-03 19:49:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 349 transitions. [2025-03-03 19:49:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-03 19:49:05,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:05,210 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:05,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:49:05,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:49:05,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:05,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:05,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1108323517, now seen corresponding path program 1 times [2025-03-03 19:49:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:05,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236134330] [2025-03-03 19:49:05,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:05,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-03 19:49:05,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-03 19:49:05,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:05,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-03 19:49:05,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:05,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236134330] [2025-03-03 19:49:05,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236134330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:05,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:05,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:05,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156475148] [2025-03-03 19:49:05,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:05,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:05,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:05,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:05,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:05,830 INFO L87 Difference]: Start difference. First operand 213 states and 349 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:05,923 INFO L93 Difference]: Finished difference Result 529 states and 870 transitions. [2025-03-03 19:49:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:05,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 449 [2025-03-03 19:49:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:05,930 INFO L225 Difference]: With dead ends: 529 [2025-03-03 19:49:05,931 INFO L226 Difference]: Without dead ends: 319 [2025-03-03 19:49:05,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:05,933 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 165 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:05,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 742 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:49:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-03 19:49:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2025-03-03 19:49:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 229 states have (on average 1.519650655021834) internal successors, (348), 230 states have internal predecessors, (348), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 19:49:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 516 transitions. [2025-03-03 19:49:05,970 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 516 transitions. Word has length 449 [2025-03-03 19:49:05,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:05,971 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 516 transitions. [2025-03-03 19:49:05,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 516 transitions. [2025-03-03 19:49:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-03 19:49:05,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:05,980 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:05,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:49:05,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:05,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1215138870, now seen corresponding path program 1 times [2025-03-03 19:49:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686479491] [2025-03-03 19:49:05,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:06,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-03 19:49:06,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-03 19:49:06,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:06,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-03 19:49:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686479491] [2025-03-03 19:49:06,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686479491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:06,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:06,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028896028] [2025-03-03 19:49:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:06,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:06,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:06,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:06,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:06,221 INFO L87 Difference]: Start difference. First operand 316 states and 516 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:06,287 INFO L93 Difference]: Finished difference Result 826 states and 1344 transitions. [2025-03-03 19:49:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:06,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 451 [2025-03-03 19:49:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:06,295 INFO L225 Difference]: With dead ends: 826 [2025-03-03 19:49:06,296 INFO L226 Difference]: Without dead ends: 513 [2025-03-03 19:49:06,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:06,298 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 203 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:06,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 836 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-03 19:49:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2025-03-03 19:49:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 363 states have (on average 1.4820936639118458) internal successors, (538), 366 states have internal predecessors, (538), 142 states have call successors, (142), 4 states have call predecessors, (142), 4 states have return successors, (142), 139 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-03 19:49:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 822 transitions. [2025-03-03 19:49:06,347 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 822 transitions. Word has length 451 [2025-03-03 19:49:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:06,349 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 822 transitions. [2025-03-03 19:49:06,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 822 transitions. [2025-03-03 19:49:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-03 19:49:06,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:06,354 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:06,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:49:06,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:06,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash -91398695, now seen corresponding path program 1 times [2025-03-03 19:49:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:06,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574560446] [2025-03-03 19:49:06,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:06,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:06,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-03 19:49:06,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-03 19:49:06,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:06,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-03 19:49:06,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:06,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574560446] [2025-03-03 19:49:06,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574560446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:06,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:49:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267137580] [2025-03-03 19:49:06,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:06,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:49:06,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:06,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:49:06,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:49:06,833 INFO L87 Difference]: Start difference. First operand 510 states and 822 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:07,129 INFO L93 Difference]: Finished difference Result 1400 states and 2267 transitions. [2025-03-03 19:49:07,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:49:07,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 452 [2025-03-03 19:49:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:07,135 INFO L225 Difference]: With dead ends: 1400 [2025-03-03 19:49:07,135 INFO L226 Difference]: Without dead ends: 893 [2025-03-03 19:49:07,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:07,137 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 310 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:07,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1010 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:49:07,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-03-03 19:49:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 827. [2025-03-03 19:49:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 607 states have (on average 1.5107084019769357) internal successors, (917), 610 states have internal predecessors, (917), 213 states have call successors, (213), 6 states have call predecessors, (213), 6 states have return successors, (213), 210 states have call predecessors, (213), 213 states have call successors, (213) [2025-03-03 19:49:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1343 transitions. [2025-03-03 19:49:07,182 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1343 transitions. Word has length 452 [2025-03-03 19:49:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:07,183 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1343 transitions. [2025-03-03 19:49:07,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1343 transitions. [2025-03-03 19:49:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-03 19:49:07,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:07,187 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:07,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:49:07,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:07,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1338247185, now seen corresponding path program 1 times [2025-03-03 19:49:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:07,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213496626] [2025-03-03 19:49:07,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:07,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-03 19:49:07,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-03 19:49:07,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:07,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-03 19:49:07,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:07,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213496626] [2025-03-03 19:49:07,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213496626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:07,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:07,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:07,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177383690] [2025-03-03 19:49:07,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:07,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:07,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:07,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:07,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:07,527 INFO L87 Difference]: Start difference. First operand 827 states and 1343 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:07,612 INFO L93 Difference]: Finished difference Result 1985 states and 3219 transitions. [2025-03-03 19:49:07,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:07,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 453 [2025-03-03 19:49:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:07,620 INFO L225 Difference]: With dead ends: 1985 [2025-03-03 19:49:07,620 INFO L226 Difference]: Without dead ends: 1418 [2025-03-03 19:49:07,622 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-03-03 19:49:07,622 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 340 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:07,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 944 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-03-03 19:49:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 875. [2025-03-03 19:49:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 655 states have (on average 1.5038167938931297) internal successors, (985), 658 states have internal predecessors, (985), 213 states have call successors, (213), 6 states have call predecessors, (213), 6 states have return successors, (213), 210 states have call predecessors, (213), 213 states have call successors, (213) [2025-03-03 19:49:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1411 transitions. [2025-03-03 19:49:07,714 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1411 transitions. Word has length 453 [2025-03-03 19:49:07,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:07,715 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1411 transitions. [2025-03-03 19:49:07,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:07,715 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1411 transitions. [2025-03-03 19:49:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-03 19:49:07,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:07,720 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:07,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:49:07,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:07,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:07,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1271240432, now seen corresponding path program 1 times [2025-03-03 19:49:07,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:07,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123259716] [2025-03-03 19:49:07,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:07,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:07,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-03 19:49:07,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-03 19:49:07,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:07,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-03 19:49:09,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:09,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123259716] [2025-03-03 19:49:09,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123259716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:09,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:49:09,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011981515] [2025-03-03 19:49:09,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:09,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:49:09,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:09,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:49:09,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:09,261 INFO L87 Difference]: Start difference. First operand 875 states and 1411 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:09,657 INFO L93 Difference]: Finished difference Result 2148 states and 3469 transitions. [2025-03-03 19:49:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:49:09,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 453 [2025-03-03 19:49:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:09,666 INFO L225 Difference]: With dead ends: 2148 [2025-03-03 19:49:09,666 INFO L226 Difference]: Without dead ends: 1585 [2025-03-03 19:49:09,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:49:09,669 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 201 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:09,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1167 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:49:09,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-03-03 19:49:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1551. [2025-03-03 19:49:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1185 states have (on average 1.5029535864978902) internal successors, (1781), 1191 states have internal predecessors, (1781), 355 states have call successors, (355), 10 states have call predecessors, (355), 10 states have return successors, (355), 349 states have call predecessors, (355), 355 states have call successors, (355) [2025-03-03 19:49:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2491 transitions. [2025-03-03 19:49:09,789 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2491 transitions. Word has length 453 [2025-03-03 19:49:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:09,791 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2491 transitions. [2025-03-03 19:49:09,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2491 transitions. [2025-03-03 19:49:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-03 19:49:09,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:09,794 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:09,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:49:09,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:09,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:09,795 INFO L85 PathProgramCache]: Analyzing trace with hash 426768561, now seen corresponding path program 1 times [2025-03-03 19:49:09,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:09,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041868626] [2025-03-03 19:49:09,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:09,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:09,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-03 19:49:09,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-03 19:49:09,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:09,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-03 19:49:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:10,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041868626] [2025-03-03 19:49:10,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041868626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:10,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:10,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:49:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241699617] [2025-03-03 19:49:10,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:10,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:49:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:10,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:49:10,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:49:10,379 INFO L87 Difference]: Start difference. First operand 1551 states and 2491 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:10,934 INFO L93 Difference]: Finished difference Result 6227 states and 10029 transitions. [2025-03-03 19:49:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:49:10,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 453 [2025-03-03 19:49:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:10,960 INFO L225 Difference]: With dead ends: 6227 [2025-03-03 19:49:10,960 INFO L226 Difference]: Without dead ends: 4827 [2025-03-03 19:49:10,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:49:10,966 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 967 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:10,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1493 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:49:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2025-03-03 19:49:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 2676. [2025-03-03 19:49:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2676 states, 2190 states have (on average 1.5401826484018264) internal successors, (3373), 2204 states have internal predecessors, (3373), 467 states have call successors, (467), 18 states have call predecessors, (467), 18 states have return successors, (467), 453 states have call predecessors, (467), 467 states have call successors, (467) [2025-03-03 19:49:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 4307 transitions. [2025-03-03 19:49:11,199 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 4307 transitions. Word has length 453 [2025-03-03 19:49:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:11,200 INFO L471 AbstractCegarLoop]: Abstraction has 2676 states and 4307 transitions. [2025-03-03 19:49:11,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 4307 transitions. [2025-03-03 19:49:11,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-03 19:49:11,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:11,205 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:11,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:49:11,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:11,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1508891726, now seen corresponding path program 1 times [2025-03-03 19:49:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:11,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400551280] [2025-03-03 19:49:11,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:11,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:11,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-03 19:49:11,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-03 19:49:11,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:11,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 33 proven. 177 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-03 19:49:11,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400551280] [2025-03-03 19:49:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400551280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125138186] [2025-03-03 19:49:11,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:11,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:11,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:11,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:49:11,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:49:11,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-03 19:49:11,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-03 19:49:11,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:11,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:11,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:49:11,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:49:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 3984 proven. 153 refuted. 0 times theorem prover too weak. 5803 trivial. 0 not checked. [2025-03-03 19:49:12,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:49:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 57 proven. 153 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-03 19:49:12,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125138186] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:49:12,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:49:12,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-03 19:49:12,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65830685] [2025-03-03 19:49:12,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:49:12,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:49:12,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:12,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:49:12,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:49:12,638 INFO L87 Difference]: Start difference. First operand 2676 states and 4307 transitions. Second operand has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) [2025-03-03 19:49:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:14,120 INFO L93 Difference]: Finished difference Result 10964 states and 17170 transitions. [2025-03-03 19:49:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 19:49:14,121 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) Word has length 453 [2025-03-03 19:49:14,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:14,157 INFO L225 Difference]: With dead ends: 10964 [2025-03-03 19:49:14,158 INFO L226 Difference]: Without dead ends: 8446 [2025-03-03 19:49:14,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 908 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=457, Invalid=1265, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 19:49:14,168 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 1666 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:14,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 1254 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:49:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8446 states. [2025-03-03 19:49:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8446 to 2724. [2025-03-03 19:49:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2127 states have (on average 1.461212976022567) internal successors, (3108), 2149 states have internal predecessors, (3108), 547 states have call successors, (547), 49 states have call predecessors, (547), 49 states have return successors, (547), 525 states have call predecessors, (547), 547 states have call successors, (547) [2025-03-03 19:49:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 4202 transitions. [2025-03-03 19:49:14,478 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 4202 transitions. Word has length 453 [2025-03-03 19:49:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:14,479 INFO L471 AbstractCegarLoop]: Abstraction has 2724 states and 4202 transitions. [2025-03-03 19:49:14,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 3 states have call successors, (181), 2 states have call predecessors, (181), 4 states have return successors, (183), 3 states have call predecessors, (183), 3 states have call successors, (183) [2025-03-03 19:49:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 4202 transitions. [2025-03-03 19:49:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-03 19:49:14,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:14,485 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:14,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:49:14,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 19:49:14,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:14,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:14,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1668365102, now seen corresponding path program 1 times [2025-03-03 19:49:14,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098102527] [2025-03-03 19:49:14,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:14,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 19:49:14,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 19:49:14,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:14,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 186 proven. 24 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-03 19:49:15,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:15,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098102527] [2025-03-03 19:49:15,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098102527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:15,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319493474] [2025-03-03 19:49:15,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:15,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:15,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:15,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:49:15,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:49:15,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 19:49:15,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 19:49:15,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:15,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:15,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 19:49:15,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:49:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 2399 proven. 48 refuted. 0 times theorem prover too weak. 7493 trivial. 0 not checked. [2025-03-03 19:49:17,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:49:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319493474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:19,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:49:19,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2025-03-03 19:49:19,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950701129] [2025-03-03 19:49:19,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:49:19,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:49:19,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:19,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:49:19,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:49:19,583 INFO L87 Difference]: Start difference. First operand 2724 states and 4202 transitions. Second operand has 15 states, 15 states have (on average 13.133333333333333) internal successors, (197), 14 states have internal predecessors, (197), 5 states have call successors, (142), 4 states have call predecessors, (142), 6 states have return successors, (142), 5 states have call predecessors, (142), 5 states have call successors, (142) [2025-03-03 19:49:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:21,024 INFO L93 Difference]: Finished difference Result 6514 states and 10023 transitions. [2025-03-03 19:49:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 19:49:21,024 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.133333333333333) internal successors, (197), 14 states have internal predecessors, (197), 5 states have call successors, (142), 4 states have call predecessors, (142), 6 states have return successors, (142), 5 states have call predecessors, (142), 5 states have call successors, (142) Word has length 454 [2025-03-03 19:49:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:21,044 INFO L225 Difference]: With dead ends: 6514 [2025-03-03 19:49:21,044 INFO L226 Difference]: Without dead ends: 4438 [2025-03-03 19:49:21,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2025-03-03 19:49:21,054 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 1258 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 552 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 552 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:21,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 2028 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [552 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 19:49:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4438 states. [2025-03-03 19:49:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4438 to 3926. [2025-03-03 19:49:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3926 states, 3005 states have (on average 1.4386023294509152) internal successors, (4323), 3038 states have internal predecessors, (4323), 837 states have call successors, (837), 83 states have call predecessors, (837), 83 states have return successors, (837), 804 states have call predecessors, (837), 837 states have call successors, (837) [2025-03-03 19:49:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 5997 transitions. [2025-03-03 19:49:21,331 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 5997 transitions. Word has length 454 [2025-03-03 19:49:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:21,332 INFO L471 AbstractCegarLoop]: Abstraction has 3926 states and 5997 transitions. [2025-03-03 19:49:21,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.133333333333333) internal successors, (197), 14 states have internal predecessors, (197), 5 states have call successors, (142), 4 states have call predecessors, (142), 6 states have return successors, (142), 5 states have call predecessors, (142), 5 states have call successors, (142) [2025-03-03 19:49:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 5997 transitions. [2025-03-03 19:49:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-03 19:49:21,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:21,336 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:21,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:49:21,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:21,536 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:21,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1257399711, now seen corresponding path program 1 times [2025-03-03 19:49:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:21,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386678228] [2025-03-03 19:49:21,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:21,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:21,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 19:49:21,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 19:49:21,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:21,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-03 19:49:21,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:21,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386678228] [2025-03-03 19:49:21,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386678228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:21,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:21,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:21,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115408612] [2025-03-03 19:49:21,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:21,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:21,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:21,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:21,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:21,638 INFO L87 Difference]: Start difference. First operand 3926 states and 5997 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:21,845 INFO L93 Difference]: Finished difference Result 7368 states and 11220 transitions. [2025-03-03 19:49:21,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:21,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 454 [2025-03-03 19:49:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:21,878 INFO L225 Difference]: With dead ends: 7368 [2025-03-03 19:49:21,879 INFO L226 Difference]: Without dead ends: 3955 [2025-03-03 19:49:21,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-03-03 19:49:21,890 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 208 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:21,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 714 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2025-03-03 19:49:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 2668. [2025-03-03 19:49:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2152 states have (on average 1.4646840148698885) internal successors, (3152), 2167 states have internal predecessors, (3152), 467 states have call successors, (467), 48 states have call predecessors, (467), 48 states have return successors, (467), 452 states have call predecessors, (467), 467 states have call successors, (467) [2025-03-03 19:49:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4086 transitions. [2025-03-03 19:49:22,153 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4086 transitions. Word has length 454 [2025-03-03 19:49:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:22,155 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4086 transitions. [2025-03-03 19:49:22,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-03 19:49:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4086 transitions. [2025-03-03 19:49:22,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-03 19:49:22,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:22,159 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:22,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:49:22,159 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:22,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1087267330, now seen corresponding path program 1 times [2025-03-03 19:49:22,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:22,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552097968] [2025-03-03 19:49:22,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:22,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 19:49:22,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 19:49:22,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:22,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-03 19:49:22,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:22,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552097968] [2025-03-03 19:49:22,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552097968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:22,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234045364] [2025-03-03 19:49:22,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:22,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:22,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:22,454 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:49:22,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 19:49:22,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 19:49:22,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 19:49:22,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:22,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:22,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:49:22,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:49:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 5040 proven. 105 refuted. 0 times theorem prover too weak. 4795 trivial. 0 not checked. [2025-03-03 19:49:22,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:49:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-03 19:49:23,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234045364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:49:23,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:49:23,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 19:49:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443713171] [2025-03-03 19:49:23,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:49:23,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 19:49:23,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:23,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 19:49:23,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:49:23,486 INFO L87 Difference]: Start difference. First operand 2668 states and 4086 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 3 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (142), 3 states have call predecessors, (142), 3 states have call successors, (142) [2025-03-03 19:49:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:23,920 INFO L93 Difference]: Finished difference Result 4944 states and 7544 transitions. [2025-03-03 19:49:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:49:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 3 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (142), 3 states have call predecessors, (142), 3 states have call successors, (142) Word has length 454 [2025-03-03 19:49:23,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:23,931 INFO L225 Difference]: With dead ends: 4944 [2025-03-03 19:49:23,951 INFO L226 Difference]: Without dead ends: 2678 [2025-03-03 19:49:23,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 905 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:49:23,958 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 525 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:23,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 625 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:49:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-03-03 19:49:24,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2654. [2025-03-03 19:49:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 2134 states have (on average 1.4592314901593253) internal successors, (3114), 2149 states have internal predecessors, (3114), 467 states have call successors, (467), 52 states have call predecessors, (467), 52 states have return successors, (467), 452 states have call predecessors, (467), 467 states have call successors, (467) [2025-03-03 19:49:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 4048 transitions. [2025-03-03 19:49:24,204 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 4048 transitions. Word has length 454 [2025-03-03 19:49:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:24,205 INFO L471 AbstractCegarLoop]: Abstraction has 2654 states and 4048 transitions. [2025-03-03 19:49:24,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 3 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (142), 3 states have call predecessors, (142), 3 states have call successors, (142) [2025-03-03 19:49:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 4048 transitions. [2025-03-03 19:49:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-03 19:49:24,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:24,212 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:24,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 19:49:24,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:24,413 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:24,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:24,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1022666305, now seen corresponding path program 1 times [2025-03-03 19:49:24,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:24,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475902220] [2025-03-03 19:49:24,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:24,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:24,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 19:49:24,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 19:49:24,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:24,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 375 proven. 39 refuted. 0 times theorem prover too weak. 9526 trivial. 0 not checked. [2025-03-03 19:49:25,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:25,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475902220] [2025-03-03 19:49:25,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475902220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:25,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958345789] [2025-03-03 19:49:25,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:25,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:25,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:25,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:49:25,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 19:49:26,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 19:49:26,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 19:49:26,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:26,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:26,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 19:49:26,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:49:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 2471 proven. 63 refuted. 0 times theorem prover too weak. 7406 trivial. 0 not checked. [2025-03-03 19:49:27,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:49:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 576 proven. 45 refuted. 0 times theorem prover too weak. 9319 trivial. 0 not checked. [2025-03-03 19:49:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958345789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:49:36,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:49:36,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 16] total 39 [2025-03-03 19:49:36,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202674566] [2025-03-03 19:49:36,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:49:36,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 19:49:36,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:36,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 19:49:36,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1033, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 19:49:36,729 INFO L87 Difference]: Start difference. First operand 2654 states and 4048 transitions. Second operand has 39 states, 37 states have (on average 8.108108108108109) internal successors, (300), 35 states have internal predecessors, (300), 15 states have call successors, (213), 7 states have call predecessors, (213), 13 states have return successors, (213), 15 states have call predecessors, (213), 15 states have call successors, (213) [2025-03-03 19:50:23,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []