./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-26.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 c89190f71494cfa64250ca9ffdf4d785818c50a201306d43ec124de4003d1620 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:08:59,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:08:59,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:08:59,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:08:59,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:08:59,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:08:59,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:08:59,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:08:59,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:08:59,271 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:08:59,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:08:59,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:08:59,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:08:59,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:08:59,273 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:08:59,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:08:59,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:08:59,273 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:08:59,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:08:59,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:08:59,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:08:59,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:08:59,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:08:59,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:08:59,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:08:59,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:08:59,274 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:08:59,274 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:08:59,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:08:59,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:08:59,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:08:59,275 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c89190f71494cfa64250ca9ffdf4d785818c50a201306d43ec124de4003d1620 [2025-03-04 00:08:59,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:08:59,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:08:59,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:08:59,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:08:59,587 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:08:59,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-26.i [2025-03-04 00:09:00,883 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f556bc525/d84b22c74096463da214539f410709ee/FLAG3c0f5d513 [2025-03-04 00:09:01,196 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:09:01,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-26.i [2025-03-04 00:09:01,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f556bc525/d84b22c74096463da214539f410709ee/FLAG3c0f5d513 [2025-03-04 00:09:01,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f556bc525/d84b22c74096463da214539f410709ee [2025-03-04 00:09:01,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:09:01,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:09:01,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:09:01,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:09:01,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:09:01,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408941e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01, skipping insertion in model container [2025-03-04 00:09:01,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:09:01,393 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_operatoramount_amount250_file-26.i[916,929] [2025-03-04 00:09:01,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:09:01,571 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:09:01,580 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_operatoramount_amount250_file-26.i[916,929] [2025-03-04 00:09:01,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:09:01,690 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:09:01,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01 WrapperNode [2025-03-04 00:09:01,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:09:01,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:09:01,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:09:01,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:09:01,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,789 INFO L138 Inliner]: procedures = 26, calls = 72, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 523 [2025-03-04 00:09:01,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:09:01,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:09:01,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:09:01,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:09:01,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,851 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-04 00:09:01,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:09:01,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:09:01,915 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:09:01,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:09:01,916 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (1/1) ... [2025-03-04 00:09:01,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:09:01,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:01,960 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-04 00:09:01,969 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-04 00:09:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:09:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:09:01,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:09:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:09:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:09:01,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:09:02,086 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:09:02,088 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:09:02,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L390: havoc property_#t~bitwise43#1;havoc property_#t~short44#1;havoc property_#t~ite46#1;havoc property_#t~bitwise45#1;havoc property_#t~short47#1;havoc property_#t~bitwise48#1;havoc property_#t~short49#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short52#1;havoc property_#t~bitwise53#1;havoc property_#t~short54#1; [2025-03-04 00:09:02,976 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-03-04 00:09:02,977 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:09:03,003 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:09:03,004 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:09:03,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:09:03 BoogieIcfgContainer [2025-03-04 00:09:03,004 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:09:03,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:09:03,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:09:03,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:09:03,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:09:01" (1/3) ... [2025-03-04 00:09:03,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fd836b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:09:03, skipping insertion in model container [2025-03-04 00:09:03,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:01" (2/3) ... [2025-03-04 00:09:03,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fd836b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:09:03, skipping insertion in model container [2025-03-04 00:09:03,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:09:03" (3/3) ... [2025-03-04 00:09:03,012 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-26.i [2025-03-04 00:09:03,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:09:03,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-26.i that has 2 procedures, 220 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:09:03,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:09:03,091 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;@3d97ff22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:09:03,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:09:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 158 states have (on average 1.481012658227848) internal successors, (234), 159 states have internal predecessors, (234), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 00:09:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-04 00:09:03,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:03,118 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:03,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:03,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:03,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1719053574, now seen corresponding path program 1 times [2025-03-04 00:09:03,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299313381] [2025-03-04 00:09:03,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:03,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-04 00:09:03,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-04 00:09:03,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:03,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:09:03,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:03,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299313381] [2025-03-04 00:09:03,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299313381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:03,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:03,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:03,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921277662] [2025-03-04 00:09:03,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:03,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:03,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:04,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:04,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:04,004 INFO L87 Difference]: Start difference. First operand has 220 states, 158 states have (on average 1.481012658227848) internal successors, (234), 159 states have internal predecessors, (234), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:04,280 INFO L93 Difference]: Finished difference Result 643 states and 1154 transitions. [2025-03-04 00:09:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:04,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 392 [2025-03-04 00:09:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:04,298 INFO L225 Difference]: With dead ends: 643 [2025-03-04 00:09:04,299 INFO L226 Difference]: Without dead ends: 426 [2025-03-04 00:09:04,304 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-04 00:09:04,308 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 308 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:04,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 654 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:09:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-04 00:09:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 260. [2025-03-04 00:09:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 199 states have (on average 1.5175879396984924) internal successors, (302), 199 states have internal predecessors, (302), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 00:09:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 420 transitions. [2025-03-04 00:09:04,397 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 420 transitions. Word has length 392 [2025-03-04 00:09:04,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:04,402 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 420 transitions. [2025-03-04 00:09:04,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 420 transitions. [2025-03-04 00:09:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-04 00:09:04,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:04,413 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:04,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 00:09:04,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:04,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:04,414 INFO L85 PathProgramCache]: Analyzing trace with hash 182275061, now seen corresponding path program 1 times [2025-03-04 00:09:04,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:04,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689029393] [2025-03-04 00:09:04,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:04,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:04,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-04 00:09:04,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-04 00:09:04,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:04,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:09:04,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:04,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689029393] [2025-03-04 00:09:04,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689029393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:04,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:04,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78468272] [2025-03-04 00:09:04,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:04,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:04,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:04,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:04,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:04,976 INFO L87 Difference]: Start difference. First operand 260 states and 420 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:05,146 INFO L93 Difference]: Finished difference Result 623 states and 1008 transitions. [2025-03-04 00:09:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:05,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 392 [2025-03-04 00:09:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:05,153 INFO L225 Difference]: With dead ends: 623 [2025-03-04 00:09:05,156 INFO L226 Difference]: Without dead ends: 366 [2025-03-04 00:09:05,158 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-04 00:09:05,159 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 125 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:05,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 635 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-04 00:09:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2025-03-04 00:09:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 268 states have (on average 1.5634328358208955) internal successors, (419), 268 states have internal predecessors, (419), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 00:09:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 537 transitions. [2025-03-04 00:09:05,193 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 537 transitions. Word has length 392 [2025-03-04 00:09:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:05,194 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 537 transitions. [2025-03-04 00:09:05,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 537 transitions. [2025-03-04 00:09:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-04 00:09:05,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:05,207 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:05,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:09:05,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:05,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash -638743721, now seen corresponding path program 1 times [2025-03-04 00:09:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123653297] [2025-03-04 00:09:05,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:05,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-04 00:09:05,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-04 00:09:05,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:05,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:09:06,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:06,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123653297] [2025-03-04 00:09:06,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123653297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:06,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:06,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302442467] [2025-03-04 00:09:06,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:06,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:06,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:06,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:06,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:06,031 INFO L87 Difference]: Start difference. First operand 329 states and 537 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:06,157 INFO L93 Difference]: Finished difference Result 981 states and 1605 transitions. [2025-03-04 00:09:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:06,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 393 [2025-03-04 00:09:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:06,166 INFO L225 Difference]: With dead ends: 981 [2025-03-04 00:09:06,168 INFO L226 Difference]: Without dead ends: 655 [2025-03-04 00:09:06,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:06,170 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 232 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:06,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 650 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-04 00:09:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 653. [2025-03-04 00:09:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 532 states have (on average 1.556390977443609) internal successors, (828), 532 states have internal predecessors, (828), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-04 00:09:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1064 transitions. [2025-03-04 00:09:06,242 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1064 transitions. Word has length 393 [2025-03-04 00:09:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:06,243 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1064 transitions. [2025-03-04 00:09:06,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1064 transitions. [2025-03-04 00:09:06,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-04 00:09:06,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:06,249 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:06,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:09:06,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:06,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:06,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1377870183, now seen corresponding path program 1 times [2025-03-04 00:09:06,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:06,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220689270] [2025-03-04 00:09:06,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:06,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:06,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-04 00:09:06,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-04 00:09:06,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:06,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:09:07,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:07,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220689270] [2025-03-04 00:09:07,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220689270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:07,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:07,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:09:07,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041030675] [2025-03-04 00:09:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:07,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:09:07,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:07,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:09:07,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:09:07,603 INFO L87 Difference]: Start difference. First operand 653 states and 1064 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:09:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:08,750 INFO L93 Difference]: Finished difference Result 2735 states and 4429 transitions. [2025-03-04 00:09:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:09:08,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 393 [2025-03-04 00:09:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:08,765 INFO L225 Difference]: With dead ends: 2735 [2025-03-04 00:09:08,765 INFO L226 Difference]: Without dead ends: 2085 [2025-03-04 00:09:08,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:09:08,769 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 817 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:08,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 2052 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:09:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-03-04 00:09:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1789. [2025-03-04 00:09:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1520 states have (on average 1.5572368421052631) internal successors, (2367), 1524 states have internal predecessors, (2367), 260 states have call successors, (260), 8 states have call predecessors, (260), 8 states have return successors, (260), 256 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-04 00:09:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2887 transitions. [2025-03-04 00:09:08,933 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2887 transitions. Word has length 393 [2025-03-04 00:09:08,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:08,935 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2887 transitions. [2025-03-04 00:09:08,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:09:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2887 transitions. [2025-03-04 00:09:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-04 00:09:08,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:08,945 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:08,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:09:08,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:08,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 991563802, now seen corresponding path program 1 times [2025-03-04 00:09:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655791873] [2025-03-04 00:09:08,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:08,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-04 00:09:09,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-04 00:09:09,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:09,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:09:09,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:09,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655791873] [2025-03-04 00:09:09,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655791873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:09,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:09,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:09:09,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638957506] [2025-03-04 00:09:09,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:09,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:09:09,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:09,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:09:09,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:09:09,960 INFO L87 Difference]: Start difference. First operand 1789 states and 2887 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:10,589 INFO L93 Difference]: Finished difference Result 4327 states and 6938 transitions. [2025-03-04 00:09:10,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:09:10,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 393 [2025-03-04 00:09:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:10,606 INFO L225 Difference]: With dead ends: 4327 [2025-03-04 00:09:10,606 INFO L226 Difference]: Without dead ends: 3501 [2025-03-04 00:09:10,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:10,612 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 637 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:10,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1425 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:09:10,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2025-03-04 00:09:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3281. [2025-03-04 00:09:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3281 states, 2844 states have (on average 1.560829817158931) internal successors, (4439), 2854 states have internal predecessors, (4439), 420 states have call successors, (420), 16 states have call predecessors, (420), 16 states have return successors, (420), 410 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-04 00:09:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 5279 transitions. [2025-03-04 00:09:10,778 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 5279 transitions. Word has length 393 [2025-03-04 00:09:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:10,779 INFO L471 AbstractCegarLoop]: Abstraction has 3281 states and 5279 transitions. [2025-03-04 00:09:10,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 5279 transitions. [2025-03-04 00:09:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-04 00:09:10,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:10,788 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:10,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:09:10,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:10,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:10,789 INFO L85 PathProgramCache]: Analyzing trace with hash -140594818, now seen corresponding path program 1 times [2025-03-04 00:09:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:10,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105492212] [2025-03-04 00:09:10,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:10,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-04 00:09:10,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-04 00:09:10,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:10,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:09:10,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:10,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105492212] [2025-03-04 00:09:10,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105492212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:10,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:10,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:10,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539853331] [2025-03-04 00:09:10,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:10,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:10,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:10,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:10,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:10,946 INFO L87 Difference]: Start difference. First operand 3281 states and 5279 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:11,162 INFO L93 Difference]: Finished difference Result 5794 states and 9257 transitions. [2025-03-04 00:09:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:11,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 393 [2025-03-04 00:09:11,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:11,184 INFO L225 Difference]: With dead ends: 5794 [2025-03-04 00:09:11,185 INFO L226 Difference]: Without dead ends: 4142 [2025-03-04 00:09:11,190 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-04 00:09:11,192 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 307 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:11,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 974 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:11,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2025-03-04 00:09:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 3281. [2025-03-04 00:09:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3281 states, 2844 states have (on average 1.5467651195499297) internal successors, (4399), 2854 states have internal predecessors, (4399), 420 states have call successors, (420), 16 states have call predecessors, (420), 16 states have return successors, (420), 410 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-04 00:09:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 5239 transitions. [2025-03-04 00:09:11,389 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 5239 transitions. Word has length 393 [2025-03-04 00:09:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:11,390 INFO L471 AbstractCegarLoop]: Abstraction has 3281 states and 5239 transitions. [2025-03-04 00:09:11,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 5239 transitions. [2025-03-04 00:09:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-04 00:09:11,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:11,397 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:11,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:09:11,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:11,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:11,398 INFO L85 PathProgramCache]: Analyzing trace with hash -748010754, now seen corresponding path program 1 times [2025-03-04 00:09:11,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:11,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857493008] [2025-03-04 00:09:11,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:11,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-04 00:09:11,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-04 00:09:11,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:11,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:09:12,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:12,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857493008] [2025-03-04 00:09:12,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857493008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:12,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:12,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:09:12,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315265658] [2025-03-04 00:09:12,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:12,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:09:12,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:12,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:09:12,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:09:12,542 INFO L87 Difference]: Start difference. First operand 3281 states and 5239 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:09:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:14,400 INFO L93 Difference]: Finished difference Result 15664 states and 24838 transitions. [2025-03-04 00:09:14,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 00:09:14,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 394 [2025-03-04 00:09:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:14,457 INFO L225 Difference]: With dead ends: 15664 [2025-03-04 00:09:14,457 INFO L226 Difference]: Without dead ends: 12386 [2025-03-04 00:09:14,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2025-03-04 00:09:14,473 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 2006 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:14,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 2203 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:09:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2025-03-04 00:09:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 6702. [2025-03-04 00:09:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6702 states, 6202 states have (on average 1.5822315382134795) internal successors, (9813), 6212 states have internal predecessors, (9813), 479 states have call successors, (479), 20 states have call predecessors, (479), 20 states have return successors, (479), 469 states have call predecessors, (479), 479 states have call successors, (479) [2025-03-04 00:09:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 10771 transitions. [2025-03-04 00:09:14,795 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 10771 transitions. Word has length 394 [2025-03-04 00:09:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:14,796 INFO L471 AbstractCegarLoop]: Abstraction has 6702 states and 10771 transitions. [2025-03-04 00:09:14,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:09:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 10771 transitions. [2025-03-04 00:09:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-04 00:09:14,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:14,808 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:14,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:09:14,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:14,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:14,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1536852701, now seen corresponding path program 1 times [2025-03-04 00:09:14,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:14,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002479761] [2025-03-04 00:09:14,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:14,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:14,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-04 00:09:15,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-04 00:09:15,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:15,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:09:15,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:15,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002479761] [2025-03-04 00:09:15,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002479761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:15,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142578982] [2025-03-04 00:09:15,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:15,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:15,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:15,396 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-04 00:09:15,398 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-04 00:09:15,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-04 00:09:15,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-04 00:09:15,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:15,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:15,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:09:15,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3298 proven. 66 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2025-03-04 00:09:16,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 108 proven. 66 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:09:17,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142578982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:17,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:17,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-03-04 00:09:17,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543282254] [2025-03-04 00:09:17,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:17,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:09:17,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:17,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:09:17,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:09:17,036 INFO L87 Difference]: Start difference. First operand 6702 states and 10771 transitions. Second operand has 16 states, 16 states have (on average 14.375) internal successors, (230), 16 states have internal predecessors, (230), 5 states have call successors, (176), 3 states have call predecessors, (176), 6 states have return successors, (177), 5 states have call predecessors, (177), 5 states have call successors, (177) [2025-03-04 00:09:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:21,424 INFO L93 Difference]: Finished difference Result 17750 states and 28197 transitions. [2025-03-04 00:09:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-04 00:09:21,425 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 14.375) internal successors, (230), 16 states have internal predecessors, (230), 5 states have call successors, (176), 3 states have call predecessors, (176), 6 states have return successors, (177), 5 states have call predecessors, (177), 5 states have call successors, (177) Word has length 394 [2025-03-04 00:09:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:21,469 INFO L225 Difference]: With dead ends: 17750 [2025-03-04 00:09:21,470 INFO L226 Difference]: Without dead ends: 11449 [2025-03-04 00:09:21,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 855 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1065, Invalid=4191, Unknown=0, NotChecked=0, Total=5256 [2025-03-04 00:09:21,486 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 4644 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 2144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 3882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2144 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:21,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 2145 Invalid, 3882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2144 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 00:09:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11449 states. [2025-03-04 00:09:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11449 to 8532. [2025-03-04 00:09:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8532 states, 7442 states have (on average 1.5231120666487503) internal successors, (11335), 7468 states have internal predecessors, (11335), 1009 states have call successors, (1009), 80 states have call predecessors, (1009), 80 states have return successors, (1009), 983 states have call predecessors, (1009), 1009 states have call successors, (1009) [2025-03-04 00:09:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8532 states to 8532 states and 13353 transitions. [2025-03-04 00:09:22,047 INFO L78 Accepts]: Start accepts. Automaton has 8532 states and 13353 transitions. Word has length 394 [2025-03-04 00:09:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:22,048 INFO L471 AbstractCegarLoop]: Abstraction has 8532 states and 13353 transitions. [2025-03-04 00:09:22,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.375) internal successors, (230), 16 states have internal predecessors, (230), 5 states have call successors, (176), 3 states have call predecessors, (176), 6 states have return successors, (177), 5 states have call predecessors, (177), 5 states have call successors, (177) [2025-03-04 00:09:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 8532 states and 13353 transitions. [2025-03-04 00:09:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-04 00:09:22,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:22,060 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:22,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:09:22,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:22,265 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:22,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash -671432877, now seen corresponding path program 1 times [2025-03-04 00:09:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825052902] [2025-03-04 00:09:22,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:22,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-04 00:09:22,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-04 00:09:22,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:22,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:09:22,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:22,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825052902] [2025-03-04 00:09:22,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825052902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:22,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:22,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:09:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92384480] [2025-03-04 00:09:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:22,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:09:22,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:22,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:09:22,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:22,575 INFO L87 Difference]: Start difference. First operand 8532 states and 13353 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:22,996 INFO L93 Difference]: Finished difference Result 21547 states and 33777 transitions. [2025-03-04 00:09:22,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:22,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 394 [2025-03-04 00:09:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:23,033 INFO L225 Difference]: With dead ends: 21547 [2025-03-04 00:09:23,033 INFO L226 Difference]: Without dead ends: 14363 [2025-03-04 00:09:23,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:09:23,047 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 138 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:23,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1104 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:09:23,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14363 states. [2025-03-04 00:09:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14363 to 9468. [2025-03-04 00:09:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9468 states, 8378 states have (on average 1.5237526856051564) internal successors, (12766), 8404 states have internal predecessors, (12766), 1009 states have call successors, (1009), 80 states have call predecessors, (1009), 80 states have return successors, (1009), 983 states have call predecessors, (1009), 1009 states have call successors, (1009) [2025-03-04 00:09:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9468 states to 9468 states and 14784 transitions. [2025-03-04 00:09:23,472 INFO L78 Accepts]: Start accepts. Automaton has 9468 states and 14784 transitions. Word has length 394 [2025-03-04 00:09:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:23,474 INFO L471 AbstractCegarLoop]: Abstraction has 9468 states and 14784 transitions. [2025-03-04 00:09:23,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 9468 states and 14784 transitions. [2025-03-04 00:09:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-04 00:09:23,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:23,480 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:23,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:09:23,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:23,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:23,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1696126798, now seen corresponding path program 1 times [2025-03-04 00:09:23,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:23,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897264786] [2025-03-04 00:09:23,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:23,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:23,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-04 00:09:23,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-04 00:09:23,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:23,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 27 proven. 147 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:09:24,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:24,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897264786] [2025-03-04 00:09:24,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897264786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:24,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635987752] [2025-03-04 00:09:24,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:24,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:24,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:24,227 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-04 00:09:24,229 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-04 00:09:24,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-04 00:09:24,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-04 00:09:24,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:24,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:24,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:09:24,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 1840 proven. 147 refuted. 0 times theorem prover too weak. 4857 trivial. 0 not checked. [2025-03-04 00:09:25,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 27 proven. 147 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:09:26,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635987752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:26,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:26,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 14 [2025-03-04 00:09:26,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884558694] [2025-03-04 00:09:26,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:26,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:09:26,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:26,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:09:26,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:09:26,053 INFO L87 Difference]: Start difference. First operand 9468 states and 14784 transitions. Second operand has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 14 states have internal predecessors, (157), 4 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) [2025-03-04 00:09:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:28,189 INFO L93 Difference]: Finished difference Result 34116 states and 52823 transitions. [2025-03-04 00:09:28,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 00:09:28,190 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 14 states have internal predecessors, (157), 4 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) Word has length 394 [2025-03-04 00:09:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:28,267 INFO L225 Difference]: With dead ends: 34116 [2025-03-04 00:09:28,267 INFO L226 Difference]: Without dead ends: 25191 [2025-03-04 00:09:28,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 785 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 00:09:28,295 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 2183 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2241 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:28,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2241 Valid, 1854 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 00:09:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25191 states. [2025-03-04 00:09:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25191 to 20416. [2025-03-04 00:09:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20416 states, 17972 states have (on average 1.5012241264188737) internal successors, (26980), 18057 states have internal predecessors, (26980), 2217 states have call successors, (2217), 226 states have call predecessors, (2217), 226 states have return successors, (2217), 2132 states have call predecessors, (2217), 2217 states have call successors, (2217) [2025-03-04 00:09:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20416 states to 20416 states and 31414 transitions. [2025-03-04 00:09:29,262 INFO L78 Accepts]: Start accepts. Automaton has 20416 states and 31414 transitions. Word has length 394 [2025-03-04 00:09:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:29,263 INFO L471 AbstractCegarLoop]: Abstraction has 20416 states and 31414 transitions. [2025-03-04 00:09:29,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 14 states have internal predecessors, (157), 4 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) [2025-03-04 00:09:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 20416 states and 31414 transitions. [2025-03-04 00:09:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-03-04 00:09:29,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:29,268 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:29,277 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-04 00:09:29,469 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,SelfDestructingSolverStorable9 [2025-03-04 00:09:29,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:29,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1303710342, now seen corresponding path program 1 times [2025-03-04 00:09:29,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:29,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938166762] [2025-03-04 00:09:29,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:29,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:29,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-03-04 00:09:29,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-03-04 00:09:29,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:29,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:09:30,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:30,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938166762] [2025-03-04 00:09:30,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938166762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372547130] [2025-03-04 00:09:30,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:30,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:30,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:30,254 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-04 00:09:30,256 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-04 00:09:30,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-03-04 00:09:30,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-03-04 00:09:30,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:30,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:30,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:09:30,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3408 proven. 99 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2025-03-04 00:09:30,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 75 proven. 99 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:09:31,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372547130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:31,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:31,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-03-04 00:09:31,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266781432] [2025-03-04 00:09:31,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:31,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:09:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:31,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:09:31,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:09:31,364 INFO L87 Difference]: Start difference. First operand 20416 states and 31414 transitions. Second operand has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 5 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (152), 4 states have call predecessors, (152), 5 states have call successors, (152) [2025-03-04 00:09:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:33,457 INFO L93 Difference]: Finished difference Result 56608 states and 86840 transitions. [2025-03-04 00:09:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 00:09:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 5 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (152), 4 states have call predecessors, (152), 5 states have call successors, (152) Word has length 396 [2025-03-04 00:09:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:33,718 INFO L225 Difference]: With dead ends: 56608 [2025-03-04 00:09:33,719 INFO L226 Difference]: Without dead ends: 36631 [2025-03-04 00:09:33,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:09:33,757 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 878 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:33,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1279 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:09:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36631 states. [2025-03-04 00:09:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36631 to 20580. [2025-03-04 00:09:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20580 states, 18095 states have (on average 1.4480795799944737) internal successors, (26203), 18180 states have internal predecessors, (26203), 2217 states have call successors, (2217), 267 states have call predecessors, (2217), 267 states have return successors, (2217), 2132 states have call predecessors, (2217), 2217 states have call successors, (2217) [2025-03-04 00:09:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20580 states to 20580 states and 30637 transitions. [2025-03-04 00:09:35,137 INFO L78 Accepts]: Start accepts. Automaton has 20580 states and 30637 transitions. Word has length 396 [2025-03-04 00:09:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:35,141 INFO L471 AbstractCegarLoop]: Abstraction has 20580 states and 30637 transitions. [2025-03-04 00:09:35,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 5 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (152), 4 states have call predecessors, (152), 5 states have call successors, (152) [2025-03-04 00:09:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 20580 states and 30637 transitions. [2025-03-04 00:09:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-04 00:09:35,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:35,147 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:35,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:09:35,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:35,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:35,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:35,350 INFO L85 PathProgramCache]: Analyzing trace with hash 571181371, now seen corresponding path program 1 times [2025-03-04 00:09:35,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:35,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502167052] [2025-03-04 00:09:35,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:35,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:35,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-03-04 00:09:35,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-03-04 00:09:35,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:35,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 33 proven. 141 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:09:36,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:36,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502167052] [2025-03-04 00:09:36,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502167052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000306275] [2025-03-04 00:09:36,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:36,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:36,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:36,095 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-04 00:09:36,096 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-04 00:09:36,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-03-04 00:09:36,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-03-04 00:09:36,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:36,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:36,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:09:36,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 2148 proven. 141 refuted. 0 times theorem prover too weak. 4555 trivial. 0 not checked. [2025-03-04 00:09:37,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 33 proven. 141 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:09:37,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000306275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:37,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:37,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-03-04 00:09:37,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940186051] [2025-03-04 00:09:37,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:37,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:09:37,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:37,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:09:37,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:09:37,624 INFO L87 Difference]: Start difference. First operand 20580 states and 30637 transitions. Second operand has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 5 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 5 states have call predecessors, (177), 5 states have call successors, (177) [2025-03-04 00:09:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:40,621 INFO L93 Difference]: Finished difference Result 71961 states and 107339 transitions. [2025-03-04 00:09:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:09:40,622 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 5 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 5 states have call predecessors, (177), 5 states have call successors, (177) Word has length 398 [2025-03-04 00:09:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:40,760 INFO L225 Difference]: With dead ends: 71961 [2025-03-04 00:09:40,761 INFO L226 Difference]: Without dead ends: 52152 [2025-03-04 00:09:40,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 787 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-03-04 00:09:40,796 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 966 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:40,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1961 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:09:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52152 states. [2025-03-04 00:09:42,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52152 to 36377. [2025-03-04 00:09:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36377 states, 31626 states have (on average 1.4374565231138936) internal successors, (45461), 31772 states have internal predecessors, (45461), 4231 states have call successors, (4231), 519 states have call predecessors, (4231), 519 states have return successors, (4231), 4085 states have call predecessors, (4231), 4231 states have call successors, (4231) [2025-03-04 00:09:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 53923 transitions. [2025-03-04 00:09:43,005 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 53923 transitions. Word has length 398 [2025-03-04 00:09:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:43,006 INFO L471 AbstractCegarLoop]: Abstraction has 36377 states and 53923 transitions. [2025-03-04 00:09:43,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 5 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 5 states have call predecessors, (177), 5 states have call successors, (177) [2025-03-04 00:09:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 53923 transitions. [2025-03-04 00:09:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-04 00:09:43,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:43,017 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:43,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:09:43,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:43,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:43,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1359437734, now seen corresponding path program 1 times [2025-03-04 00:09:43,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:43,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721622375] [2025-03-04 00:09:43,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:43,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-03-04 00:09:43,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-03-04 00:09:43,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:43,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:09:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:44,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721622375] [2025-03-04 00:09:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721622375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:44,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:44,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:09:44,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700503715] [2025-03-04 00:09:44,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:44,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:09:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:44,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:09:44,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:09:44,221 INFO L87 Difference]: Start difference. First operand 36377 states and 53923 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:09:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:47,419 INFO L93 Difference]: Finished difference Result 73832 states and 109125 transitions. [2025-03-04 00:09:47,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:09:47,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 398 [2025-03-04 00:09:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:47,520 INFO L225 Difference]: With dead ends: 73832 [2025-03-04 00:09:47,521 INFO L226 Difference]: Without dead ends: 39859 [2025-03-04 00:09:47,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:09:47,570 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1058 mSDsluCounter, 2266 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 2736 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:47,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 2736 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:09:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39859 states. [2025-03-04 00:09:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39859 to 38843. [2025-03-04 00:09:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38843 states, 33852 states have (on average 1.434479498995628) internal successors, (48560), 34016 states have internal predecessors, (48560), 4419 states have call successors, (4419), 571 states have call predecessors, (4419), 571 states have return successors, (4419), 4255 states have call predecessors, (4419), 4419 states have call successors, (4419) [2025-03-04 00:09:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38843 states to 38843 states and 57398 transitions. [2025-03-04 00:09:49,436 INFO L78 Accepts]: Start accepts. Automaton has 38843 states and 57398 transitions. Word has length 398 [2025-03-04 00:09:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:49,437 INFO L471 AbstractCegarLoop]: Abstraction has 38843 states and 57398 transitions. [2025-03-04 00:09:49,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:09:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 38843 states and 57398 transitions. [2025-03-04 00:09:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-03-04 00:09:49,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:49,446 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:49,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:09:49,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:49,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:49,447 INFO L85 PathProgramCache]: Analyzing trace with hash -75451675, now seen corresponding path program 1 times [2025-03-04 00:09:49,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:49,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995276302] [2025-03-04 00:09:49,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:49,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:49,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-03-04 00:09:49,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-03-04 00:09:49,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:49,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:09:49,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:49,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995276302] [2025-03-04 00:09:49,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995276302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:49,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:49,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:09:49,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75046797] [2025-03-04 00:09:49,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:49,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:09:49,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:49,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:09:49,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:49,713 INFO L87 Difference]: Start difference. First operand 38843 states and 57398 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:52,136 INFO L93 Difference]: Finished difference Result 82045 states and 122015 transitions. [2025-03-04 00:09:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:09:52,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 399 [2025-03-04 00:09:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:52,253 INFO L225 Difference]: With dead ends: 82045 [2025-03-04 00:09:52,253 INFO L226 Difference]: Without dead ends: 62388 [2025-03-04 00:09:52,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:09:52,288 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 355 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:52,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1828 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:09:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62388 states. [2025-03-04 00:09:54,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62388 to 42675. [2025-03-04 00:09:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42675 states, 37684 states have (on average 1.4403194989916144) internal successors, (54277), 37848 states have internal predecessors, (54277), 4419 states have call successors, (4419), 571 states have call predecessors, (4419), 571 states have return successors, (4419), 4255 states have call predecessors, (4419), 4419 states have call successors, (4419) [2025-03-04 00:09:54,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42675 states to 42675 states and 63115 transitions. [2025-03-04 00:09:54,363 INFO L78 Accepts]: Start accepts. Automaton has 42675 states and 63115 transitions. Word has length 399 [2025-03-04 00:09:54,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:54,364 INFO L471 AbstractCegarLoop]: Abstraction has 42675 states and 63115 transitions. [2025-03-04 00:09:54,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 42675 states and 63115 transitions. [2025-03-04 00:09:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-03-04 00:09:54,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:54,375 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:54,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:09:54,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:54,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2006070780, now seen corresponding path program 1 times [2025-03-04 00:09:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828848813] [2025-03-04 00:09:54,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:54,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-03-04 00:09:54,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-03-04 00:09:54,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:54,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:09:54,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:54,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828848813] [2025-03-04 00:09:54,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828848813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:54,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:54,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:09:54,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184002791] [2025-03-04 00:09:54,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:54,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:09:54,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:54,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:09:54,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:54,613 INFO L87 Difference]: Start difference. First operand 42675 states and 63115 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:56,832 INFO L93 Difference]: Finished difference Result 83453 states and 123376 transitions. [2025-03-04 00:09:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:09:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 399 [2025-03-04 00:09:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:56,928 INFO L225 Difference]: With dead ends: 83453 [2025-03-04 00:09:56,928 INFO L226 Difference]: Without dead ends: 40925 [2025-03-04 00:09:56,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:09:56,976 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 271 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:56,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1340 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:09:56,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40925 states. [2025-03-04 00:09:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40925 to 40525. [2025-03-04 00:09:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40525 states, 35534 states have (on average 1.437468340181235) internal successors, (51079), 35698 states have internal predecessors, (51079), 4419 states have call successors, (4419), 571 states have call predecessors, (4419), 571 states have return successors, (4419), 4255 states have call predecessors, (4419), 4419 states have call successors, (4419) [2025-03-04 00:09:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40525 states to 40525 states and 59917 transitions. [2025-03-04 00:09:59,553 INFO L78 Accepts]: Start accepts. Automaton has 40525 states and 59917 transitions. Word has length 399 [2025-03-04 00:09:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:59,554 INFO L471 AbstractCegarLoop]: Abstraction has 40525 states and 59917 transitions. [2025-03-04 00:09:59,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:09:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 40525 states and 59917 transitions. [2025-03-04 00:09:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-03-04 00:09:59,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:59,559 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:59,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:09:59,559 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:59,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash -64097691, now seen corresponding path program 1 times [2025-03-04 00:09:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:59,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579704432] [2025-03-04 00:09:59,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:59,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-03-04 00:09:59,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-03-04 00:09:59,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:59,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:10:00,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:00,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579704432] [2025-03-04 00:10:00,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579704432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:00,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:00,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:10:00,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118294021] [2025-03-04 00:10:00,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:00,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:10:00,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:00,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:10:00,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:10:00,311 INFO L87 Difference]: Start difference. First operand 40525 states and 59917 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:10:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:03,447 INFO L93 Difference]: Finished difference Result 88753 states and 130794 transitions. [2025-03-04 00:10:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 00:10:03,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 399 [2025-03-04 00:10:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:03,591 INFO L225 Difference]: With dead ends: 88753 [2025-03-04 00:10:03,591 INFO L226 Difference]: Without dead ends: 49479 [2025-03-04 00:10:03,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:10:03,667 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1342 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 2312 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:03,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 2312 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 00:10:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49479 states. [2025-03-04 00:10:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49479 to 41283. [2025-03-04 00:10:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41283 states, 36292 states have (on average 1.4383059627466108) internal successors, (52199), 36456 states have internal predecessors, (52199), 4419 states have call successors, (4419), 571 states have call predecessors, (4419), 571 states have return successors, (4419), 4255 states have call predecessors, (4419), 4419 states have call successors, (4419) [2025-03-04 00:10:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41283 states to 41283 states and 61037 transitions. [2025-03-04 00:10:05,680 INFO L78 Accepts]: Start accepts. Automaton has 41283 states and 61037 transitions. Word has length 399 [2025-03-04 00:10:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:05,681 INFO L471 AbstractCegarLoop]: Abstraction has 41283 states and 61037 transitions. [2025-03-04 00:10:05,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-03-04 00:10:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 41283 states and 61037 transitions. [2025-03-04 00:10:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-03-04 00:10:05,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:05,689 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:05,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:10:05,689 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:05,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2074201532, now seen corresponding path program 1 times [2025-03-04 00:10:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:05,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800016767] [2025-03-04 00:10:05,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:05,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:05,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-03-04 00:10:05,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-03-04 00:10:05,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:05,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:10:06,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:06,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800016767] [2025-03-04 00:10:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800016767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:06,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:06,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:10:06,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361296192] [2025-03-04 00:10:06,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:06,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:10:06,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:06,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:10:06,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:10:06,280 INFO L87 Difference]: Start difference. First operand 41283 states and 61037 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59)