./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-57.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 0046004d78dce3324da2f2f9d6f041cc4a293921335da3962eaba3f6eb6b0521 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:07:40,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:07:40,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:07:40,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:07:40,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:07:40,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:07:40,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:07:40,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:07:40,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:07:40,589 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:07:40,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:07:40,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:07:40,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:07:40,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:07:40,590 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:07:40,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:07:40,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:07:40,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:07:40,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:07:40,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:07:40,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:07:40,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:07:40,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:07:40,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:07:40,592 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:07:40,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:07:40,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:07:40,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:07:40,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:07:40,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:07:40,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:07:40,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:07:40,593 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 -> 0046004d78dce3324da2f2f9d6f041cc4a293921335da3962eaba3f6eb6b0521 [2025-03-17 00:07:40,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:07:40,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:07:40,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:07:40,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:07:40,842 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:07:40,843 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-57.i [2025-03-17 00:07:42,058 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e4ae4bfd/1e7bdc5735ab4bc599499afc60a961d6/FLAGb37fb8a67 [2025-03-17 00:07:42,360 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:07:42,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-57.i [2025-03-17 00:07:42,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e4ae4bfd/1e7bdc5735ab4bc599499afc60a961d6/FLAGb37fb8a67 [2025-03-17 00:07:42,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e4ae4bfd/1e7bdc5735ab4bc599499afc60a961d6 [2025-03-17 00:07:42,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:07:42,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:07:42,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:07:42,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:07:42,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:07:42,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:42,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b191118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42, skipping insertion in model container [2025-03-17 00:07:42,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:42,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:07:42,605 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-57.i[916,929] [2025-03-17 00:07:42,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:07:42,774 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:07:42,784 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-57.i[916,929] [2025-03-17 00:07:42,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:07:42,888 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:07:42,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42 WrapperNode [2025-03-17 00:07:42,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:07:42,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:07:42,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:07:42,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:07:42,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:42,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:42,981 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 633 [2025-03-17 00:07:42,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:07:42,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:07:42,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:07:42,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:07:42,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:42,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:43,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:43,036 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-17 00:07:43,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:43,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:43,063 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:43,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:43,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:43,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:43,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:07:43,097 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:07:43,097 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:07:43,097 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:07:43,098 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (1/1) ... [2025-03-17 00:07:43,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:07:43,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:43,139 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-17 00:07:43,149 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-17 00:07:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:07:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:07:43,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:07:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:07:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:07:43,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:07:43,291 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:07:43,293 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:07:44,091 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc property_#t~bitwise69#1;havoc property_#t~short70#1;havoc property_#t~bitwise71#1;havoc property_#t~short72#1; [2025-03-17 00:07:44,173 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-17 00:07:44,174 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:07:44,209 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:07:44,211 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:07:44,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:07:44 BoogieIcfgContainer [2025-03-17 00:07:44,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:07:44,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:07:44,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:07:44,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:07:44,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:07:42" (1/3) ... [2025-03-17 00:07:44,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bedf019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:07:44, skipping insertion in model container [2025-03-17 00:07:44,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:07:42" (2/3) ... [2025-03-17 00:07:44,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bedf019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:07:44, skipping insertion in model container [2025-03-17 00:07:44,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:07:44" (3/3) ... [2025-03-17 00:07:44,219 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-57.i [2025-03-17 00:07:44,249 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:07:44,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-57.i that has 2 procedures, 272 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:07:44,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:07:44,311 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;@4ea53b9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:07:44,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:07:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 171 states have (on average 1.4970760233918128) internal successors, (256), 172 states have internal predecessors, (256), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 00:07:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-17 00:07:44,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:44,350 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:44,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:44,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:44,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2039879224, now seen corresponding path program 1 times [2025-03-17 00:07:44,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:44,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436852284] [2025-03-17 00:07:44,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:44,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:44,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-17 00:07:44,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-17 00:07:44,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:44,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-17 00:07:44,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:44,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436852284] [2025-03-17 00:07:44,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436852284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:44,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907521911] [2025-03-17 00:07:44,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:44,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:44,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:44,890 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-17 00:07:44,892 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-17 00:07:45,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-17 00:07:45,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-17 00:07:45,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:45,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:45,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:07:45,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:45,253 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-17 00:07:45,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:07:45,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907521911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:45,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:07:45,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:07:45,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918302982] [2025-03-17 00:07:45,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:45,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:07:45,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:45,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:07:45,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:07:45,281 INFO L87 Difference]: Start difference. First operand has 272 states, 171 states have (on average 1.4970760233918128) internal successors, (256), 172 states have internal predecessors, (256), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 states have internal predecessors, (116), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-17 00:07:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:45,343 INFO L93 Difference]: Finished difference Result 541 states and 1000 transitions. [2025-03-17 00:07:45,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:07:45,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 states have internal predecessors, (116), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) Word has length 601 [2025-03-17 00:07:45,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:45,353 INFO L225 Difference]: With dead ends: 541 [2025-03-17 00:07:45,354 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 00:07:45,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 602 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-17 00:07:45,363 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:45,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:07:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 00:07:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-17 00:07:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 170 states have (on average 1.4764705882352942) internal successors, (251), 170 states have internal predecessors, (251), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 00:07:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 447 transitions. [2025-03-17 00:07:45,433 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 447 transitions. Word has length 601 [2025-03-17 00:07:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:45,434 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 447 transitions. [2025-03-17 00:07:45,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 states have internal predecessors, (116), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-17 00:07:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 447 transitions. [2025-03-17 00:07:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-17 00:07:45,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:45,445 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:45,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:07:45,650 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-17 00:07:45,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:45,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:45,651 INFO L85 PathProgramCache]: Analyzing trace with hash -687195394, now seen corresponding path program 1 times [2025-03-17 00:07:45,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:45,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390521606] [2025-03-17 00:07:45,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:45,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:45,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-17 00:07:45,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-17 00:07:45,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:45,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:46,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:46,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390521606] [2025-03-17 00:07:46,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390521606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:46,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:46,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:46,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974115235] [2025-03-17 00:07:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:46,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:46,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:46,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:46,225 INFO L87 Difference]: Start difference. First operand 270 states and 447 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:46,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:46,330 INFO L93 Difference]: Finished difference Result 708 states and 1173 transitions. [2025-03-17 00:07:46,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:46,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 601 [2025-03-17 00:07:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:46,341 INFO L225 Difference]: With dead ends: 708 [2025-03-17 00:07:46,342 INFO L226 Difference]: Without dead ends: 439 [2025-03-17 00:07:46,343 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-17 00:07:46,344 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 277 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:46,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1112 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:07:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-17 00:07:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2025-03-17 00:07:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 297 states have (on average 1.5185185185185186) internal successors, (451), 298 states have internal predecessors, (451), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 00:07:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 723 transitions. [2025-03-17 00:07:46,406 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 723 transitions. Word has length 601 [2025-03-17 00:07:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:46,407 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 723 transitions. [2025-03-17 00:07:46,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 723 transitions. [2025-03-17 00:07:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-17 00:07:46,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:46,419 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:46,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:07:46,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:46,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash 81974621, now seen corresponding path program 1 times [2025-03-17 00:07:46,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:46,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765368964] [2025-03-17 00:07:46,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:46,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-17 00:07:46,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-17 00:07:46,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:46,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:46,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:46,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765368964] [2025-03-17 00:07:46,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765368964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:46,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:46,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:46,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398370756] [2025-03-17 00:07:46,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:46,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:46,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:46,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:46,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:46,794 INFO L87 Difference]: Start difference. First operand 436 states and 723 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:46,892 INFO L93 Difference]: Finished difference Result 1153 states and 1902 transitions. [2025-03-17 00:07:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:46,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 601 [2025-03-17 00:07:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:46,903 INFO L225 Difference]: With dead ends: 1153 [2025-03-17 00:07:46,904 INFO L226 Difference]: Without dead ends: 718 [2025-03-17 00:07:46,905 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-17 00:07:46,907 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 235 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:46,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 963 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:07:46,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-17 00:07:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 715. [2025-03-17 00:07:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 494 states have (on average 1.4979757085020242) internal successors, (740), 497 states have internal predecessors, (740), 216 states have call successors, (216), 4 states have call predecessors, (216), 4 states have return successors, (216), 213 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-17 00:07:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1172 transitions. [2025-03-17 00:07:46,980 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1172 transitions. Word has length 601 [2025-03-17 00:07:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:46,984 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1172 transitions. [2025-03-17 00:07:46,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1172 transitions. [2025-03-17 00:07:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-17 00:07:46,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:46,994 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:46,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:07:46,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:46,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1543554620, now seen corresponding path program 1 times [2025-03-17 00:07:46,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:46,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679780161] [2025-03-17 00:07:46,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:46,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:47,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-17 00:07:47,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-17 00:07:47,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:47,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:47,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:47,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679780161] [2025-03-17 00:07:47,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679780161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:47,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:47,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:47,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256167379] [2025-03-17 00:07:47,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:47,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:47,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:47,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:47,275 INFO L87 Difference]: Start difference. First operand 715 states and 1172 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:47,376 INFO L93 Difference]: Finished difference Result 1446 states and 2364 transitions. [2025-03-17 00:07:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:47,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 601 [2025-03-17 00:07:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:47,386 INFO L225 Difference]: With dead ends: 1446 [2025-03-17 00:07:47,388 INFO L226 Difference]: Without dead ends: 732 [2025-03-17 00:07:47,391 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-17 00:07:47,392 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 217 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:47,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 908 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:07:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-17 00:07:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 517. [2025-03-17 00:07:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 377 states have (on average 1.5251989389920424) internal successors, (575), 378 states have internal predecessors, (575), 136 states have call successors, (136), 3 states have call predecessors, (136), 3 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 00:07:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 847 transitions. [2025-03-17 00:07:47,474 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 847 transitions. Word has length 601 [2025-03-17 00:07:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:47,475 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 847 transitions. [2025-03-17 00:07:47,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 847 transitions. [2025-03-17 00:07:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-17 00:07:47,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:47,484 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:47,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:07:47,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:47,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:47,485 INFO L85 PathProgramCache]: Analyzing trace with hash -533654723, now seen corresponding path program 1 times [2025-03-17 00:07:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61192124] [2025-03-17 00:07:47,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:47,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:47,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-17 00:07:47,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-17 00:07:47,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:47,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:47,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:47,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61192124] [2025-03-17 00:07:47,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61192124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:47,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002745332] [2025-03-17 00:07:47,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:47,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:47,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:47,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:47,732 INFO L87 Difference]: Start difference. First operand 517 states and 847 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:47,821 INFO L93 Difference]: Finished difference Result 1432 states and 2349 transitions. [2025-03-17 00:07:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:47,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 601 [2025-03-17 00:07:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:47,829 INFO L225 Difference]: With dead ends: 1432 [2025-03-17 00:07:47,830 INFO L226 Difference]: Without dead ends: 916 [2025-03-17 00:07:47,831 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-17 00:07:47,832 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 241 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:47,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 864 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:07:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-03-17 00:07:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 912. [2025-03-17 00:07:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 706 states have (on average 1.5552407932011332) internal successors, (1098), 709 states have internal predecessors, (1098), 200 states have call successors, (200), 5 states have call predecessors, (200), 5 states have return successors, (200), 197 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-17 00:07:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1498 transitions. [2025-03-17 00:07:47,896 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1498 transitions. Word has length 601 [2025-03-17 00:07:47,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:47,897 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1498 transitions. [2025-03-17 00:07:47,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1498 transitions. [2025-03-17 00:07:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-17 00:07:47,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:47,901 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:47,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:07:47,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:47,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash 711109758, now seen corresponding path program 1 times [2025-03-17 00:07:47,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:47,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79920027] [2025-03-17 00:07:47,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:47,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:47,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-17 00:07:47,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-17 00:07:47,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:47,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:48,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:48,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79920027] [2025-03-17 00:07:48,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79920027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:48,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:48,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:48,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818610659] [2025-03-17 00:07:48,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:48,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:48,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:48,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:48,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:48,205 INFO L87 Difference]: Start difference. First operand 912 states and 1498 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:48,309 INFO L93 Difference]: Finished difference Result 2730 states and 4484 transitions. [2025-03-17 00:07:48,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:48,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 601 [2025-03-17 00:07:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:48,321 INFO L225 Difference]: With dead ends: 2730 [2025-03-17 00:07:48,321 INFO L226 Difference]: Without dead ends: 1819 [2025-03-17 00:07:48,324 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-17 00:07:48,325 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 437 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1128 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-17 00:07:48,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1128 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:07:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2025-03-17 00:07:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1817. [2025-03-17 00:07:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1406 states have (on average 1.5519203413940257) internal successors, (2182), 1412 states have internal predecessors, (2182), 400 states have call successors, (400), 10 states have call predecessors, (400), 10 states have return successors, (400), 394 states have call predecessors, (400), 400 states have call successors, (400) [2025-03-17 00:07:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2982 transitions. [2025-03-17 00:07:48,424 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2982 transitions. Word has length 601 [2025-03-17 00:07:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:48,425 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2982 transitions. [2025-03-17 00:07:48,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:07:48,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2982 transitions. [2025-03-17 00:07:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-17 00:07:48,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:48,430 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:48,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:07:48,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:48,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 231254812, now seen corresponding path program 1 times [2025-03-17 00:07:48,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170929421] [2025-03-17 00:07:48,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:48,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-17 00:07:48,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-17 00:07:48,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:48,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 6 proven. 285 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-17 00:07:49,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170929421] [2025-03-17 00:07:49,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170929421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:49,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018414450] [2025-03-17 00:07:49,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:49,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:49,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:49,337 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-17 00:07:49,339 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-17 00:07:49,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-17 00:07:49,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-17 00:07:49,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:49,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:49,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:07:49,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 7623 proven. 78 refuted. 0 times theorem prover too weak. 11311 trivial. 0 not checked. [2025-03-17 00:07:49,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:07:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 213 proven. 78 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-17 00:07:50,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018414450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:07:50,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:07:50,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-03-17 00:07:50,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432566037] [2025-03-17 00:07:50,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:07:50,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:07:50,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:50,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:07:50,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:07:50,470 INFO L87 Difference]: Start difference. First operand 1817 states and 2982 transitions. Second operand has 11 states, 11 states have (on average 23.454545454545453) internal successors, (258), 11 states have internal predecessors, (258), 4 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (221), 4 states have call predecessors, (221), 4 states have call successors, (221) [2025-03-17 00:07:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:51,550 INFO L93 Difference]: Finished difference Result 3709 states and 6037 transitions. [2025-03-17 00:07:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 00:07:51,551 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 23.454545454545453) internal successors, (258), 11 states have internal predecessors, (258), 4 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (221), 4 states have call predecessors, (221), 4 states have call successors, (221) Word has length 601 [2025-03-17 00:07:51,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:51,562 INFO L225 Difference]: With dead ends: 3709 [2025-03-17 00:07:51,562 INFO L226 Difference]: Without dead ends: 1893 [2025-03-17 00:07:51,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1218 GetRequests, 1199 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-03-17 00:07:51,568 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 787 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:51,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1179 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 00:07:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2025-03-17 00:07:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1873. [2025-03-17 00:07:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1452 states have (on average 1.5234159779614325) internal successors, (2212), 1458 states have internal predecessors, (2212), 400 states have call successors, (400), 20 states have call predecessors, (400), 20 states have return successors, (400), 394 states have call predecessors, (400), 400 states have call successors, (400) [2025-03-17 00:07:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3012 transitions. [2025-03-17 00:07:51,671 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3012 transitions. Word has length 601 [2025-03-17 00:07:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:51,672 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3012 transitions. [2025-03-17 00:07:51,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.454545454545453) internal successors, (258), 11 states have internal predecessors, (258), 4 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (221), 4 states have call predecessors, (221), 4 states have call successors, (221) [2025-03-17 00:07:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3012 transitions. [2025-03-17 00:07:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-03-17 00:07:51,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:51,678 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:51,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 00:07:51,881 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,SelfDestructingSolverStorable6 [2025-03-17 00:07:51,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:51,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2085348767, now seen corresponding path program 1 times [2025-03-17 00:07:51,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:51,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278313422] [2025-03-17 00:07:51,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:51,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:51,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-03-17 00:07:52,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-03-17 00:07:52,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:52,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:07:52,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:52,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278313422] [2025-03-17 00:07:52,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278313422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:52,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:52,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:07:52,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559955422] [2025-03-17 00:07:52,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:52,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:07:52,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:52,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:07:52,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:07:52,942 INFO L87 Difference]: Start difference. First operand 1873 states and 3012 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-17 00:07:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:54,771 INFO L93 Difference]: Finished difference Result 8029 states and 12783 transitions. [2025-03-17 00:07:54,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:07:54,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) Word has length 602 [2025-03-17 00:07:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:54,805 INFO L225 Difference]: With dead ends: 8029 [2025-03-17 00:07:54,805 INFO L226 Difference]: Without dead ends: 6157 [2025-03-17 00:07:54,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:07:54,814 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 1009 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 2854 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:54,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 2854 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 00:07:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6157 states. [2025-03-17 00:07:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6157 to 4919. [2025-03-17 00:07:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4919 states, 3742 states have (on average 1.4831640833778728) internal successors, (5550), 3770 states have internal predecessors, (5550), 1104 states have call successors, (1104), 72 states have call predecessors, (1104), 72 states have return successors, (1104), 1076 states have call predecessors, (1104), 1104 states have call successors, (1104) [2025-03-17 00:07:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 7758 transitions. [2025-03-17 00:07:55,178 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 7758 transitions. Word has length 602 [2025-03-17 00:07:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:55,179 INFO L471 AbstractCegarLoop]: Abstraction has 4919 states and 7758 transitions. [2025-03-17 00:07:55,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-17 00:07:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 7758 transitions. [2025-03-17 00:07:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-17 00:07:55,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:55,186 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:07:55,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:07:55,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:55,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:55,187 INFO L85 PathProgramCache]: Analyzing trace with hash -654802254, now seen corresponding path program 1 times [2025-03-17 00:07:55,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:55,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125028146] [2025-03-17 00:07:55,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:55,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:55,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-17 00:07:55,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-17 00:07:55,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:55,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:07:55,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142955113] [2025-03-17 00:07:55,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:55,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:55,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:55,554 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-17 00:07:55,556 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-17 00:07:55,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-17 00:07:55,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-17 00:07:55,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:55,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:55,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 00:07:55,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 12675 proven. 78 refuted. 0 times theorem prover too weak. 6259 trivial. 0 not checked. [2025-03-17 00:07:57,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:07:59,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125028146] [2025-03-17 00:07:59,180 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 00:07:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142955113] [2025-03-17 00:07:59,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142955113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:59,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:07:59,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-17 00:07:59,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145107938] [2025-03-17 00:07:59,181 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 00:07:59,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:07:59,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:59,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:07:59,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-03-17 00:07:59,183 INFO L87 Difference]: Start difference. First operand 4919 states and 7758 transitions. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 4 states have call successors, (98), 4 states have call predecessors, (98), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) [2025-03-17 00:08:04,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 00:08:08,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 00:08:12,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 00:08:16,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 00:08:20,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 00:08:24,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 00:08:29,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 00:08:33,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 00:08:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:34,948 INFO L93 Difference]: Finished difference Result 13333 states and 20749 transitions. [2025-03-17 00:08:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 00:08:34,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 4 states have call successors, (98), 4 states have call predecessors, (98), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) Word has length 603 [2025-03-17 00:08:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:35,057 INFO L225 Difference]: With dead ends: 13333 [2025-03-17 00:08:35,057 INFO L226 Difference]: Without dead ends: 8415 [2025-03-17 00:08:35,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1071 GetRequests, 1038 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 00:08:35,089 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 1374 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 489 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:35,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 1871 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1288 Invalid, 8 Unknown, 0 Unchecked, 34.6s Time] [2025-03-17 00:08:35,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8415 states. [2025-03-17 00:08:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8415 to 8259. [2025-03-17 00:08:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8259 states, 6294 states have (on average 1.4601207499205593) internal successors, (9190), 6354 states have internal predecessors, (9190), 1816 states have call successors, (1816), 148 states have call predecessors, (1816), 148 states have return successors, (1816), 1756 states have call predecessors, (1816), 1816 states have call successors, (1816) [2025-03-17 00:08:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8259 states to 8259 states and 12822 transitions. [2025-03-17 00:08:36,181 INFO L78 Accepts]: Start accepts. Automaton has 8259 states and 12822 transitions. Word has length 603 [2025-03-17 00:08:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:08:36,186 INFO L471 AbstractCegarLoop]: Abstraction has 8259 states and 12822 transitions. [2025-03-17 00:08:36,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 4 states have call successors, (98), 4 states have call predecessors, (98), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) [2025-03-17 00:08:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 8259 states and 12822 transitions. [2025-03-17 00:08:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-17 00:08:36,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:36,207 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:08:36,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 00:08:36,408 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-17 00:08:36,410 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:36,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash 692980971, now seen corresponding path program 1 times [2025-03-17 00:08:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:36,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920502907] [2025-03-17 00:08:36,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:36,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:36,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-17 00:08:37,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-17 00:08:37,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:37,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:08:37,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1370481761] [2025-03-17 00:08:37,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:37,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:08:37,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:08:37,207 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-17 00:08:37,209 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-17 00:08:37,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-17 00:08:37,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-17 00:08:37,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:37,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:37,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 00:08:37,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:08:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 12675 proven. 78 refuted. 0 times theorem prover too weak. 6259 trivial. 0 not checked. [2025-03-17 00:08:42,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:08:43,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:08:43,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920502907] [2025-03-17 00:08:43,630 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 00:08:43,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370481761] [2025-03-17 00:08:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370481761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:08:43,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:08:43,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-17 00:08:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789003782] [2025-03-17 00:08:43,631 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 00:08:43,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:08:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:08:43,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:08:43,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-17 00:08:43,637 INFO L87 Difference]: Start difference. First operand 8259 states and 12822 transitions. Second operand has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 4 states have call successors, (98), 4 states have call predecessors, (98), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) [2025-03-17 00:08:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:46,704 INFO L93 Difference]: Finished difference Result 16719 states and 25856 transitions. [2025-03-17 00:08:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 00:08:46,705 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 4 states have call successors, (98), 4 states have call predecessors, (98), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) Word has length 604 [2025-03-17 00:08:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:46,756 INFO L225 Difference]: With dead ends: 16719 [2025-03-17 00:08:46,757 INFO L226 Difference]: Without dead ends: 8461 [2025-03-17 00:08:46,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 1039 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2025-03-17 00:08:46,780 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 1271 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:46,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 1224 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 00:08:46,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8461 states. [2025-03-17 00:08:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8461 to 6279. [2025-03-17 00:08:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6279 states, 4690 states have (on average 1.4520255863539446) internal successors, (6810), 4734 states have internal predecessors, (6810), 1472 states have call successors, (1472), 116 states have call predecessors, (1472), 116 states have return successors, (1472), 1428 states have call predecessors, (1472), 1472 states have call successors, (1472) [2025-03-17 00:08:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6279 states to 6279 states and 9754 transitions. [2025-03-17 00:08:48,070 INFO L78 Accepts]: Start accepts. Automaton has 6279 states and 9754 transitions. Word has length 604 [2025-03-17 00:08:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:08:48,073 INFO L471 AbstractCegarLoop]: Abstraction has 6279 states and 9754 transitions. [2025-03-17 00:08:48,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 4 states have call successors, (98), 4 states have call predecessors, (98), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) [2025-03-17 00:08:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 6279 states and 9754 transitions. [2025-03-17 00:08:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-17 00:08:48,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:48,090 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:08:48,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 00:08:48,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:08:48,291 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:48,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:48,292 INFO L85 PathProgramCache]: Analyzing trace with hash -486432332, now seen corresponding path program 1 times [2025-03-17 00:08:48,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:48,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361839053] [2025-03-17 00:08:48,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:48,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-17 00:08:48,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-17 00:08:48,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:48,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:08:48,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [960515823] [2025-03-17 00:08:48,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:48,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:08:48,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:08:48,844 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-17 00:08:48,861 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-17 00:08:49,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-17 00:08:49,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-17 00:08:49,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:49,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:49,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 00:08:49,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:08:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 6847 proven. 66 refuted. 0 times theorem prover too weak. 12099 trivial. 0 not checked. [2025-03-17 00:08:51,232 INFO L312 TraceCheckSpWp]: Computing backward predicates...