./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-62.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 b8484ad89d676170f1ebc8257bb61a08ffb4a3c64438bcf46d7d2f2f3c97d92a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:09:53,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:09:53,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:09:53,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:09:53,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:09:53,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:09:53,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:09:53,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:09:53,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:09:53,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:09:53,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:09:53,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:09:53,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:09:53,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:09:53,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:09:53,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:09:53,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:09:53,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:09:53,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:09:53,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:09:53,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:09:53,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:09:53,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:09:53,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:09:53,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:09:53,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:09:53,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:09:53,246 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 -> b8484ad89d676170f1ebc8257bb61a08ffb4a3c64438bcf46d7d2f2f3c97d92a [2025-03-03 20:09:53,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:09:53,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:09:53,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:09:53,492 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:09:53,492 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:09:53,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-62.i [2025-03-03 20:09:54,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e7d5f1b/19401b89b8e6468692e4945eb11db136/FLAG270329d51 [2025-03-03 20:09:54,831 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:09:54,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-62.i [2025-03-03 20:09:54,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e7d5f1b/19401b89b8e6468692e4945eb11db136/FLAG270329d51 [2025-03-03 20:09:55,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e7d5f1b/19401b89b8e6468692e4945eb11db136 [2025-03-03 20:09:55,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:09:55,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:09:55,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:09:55,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:09:55,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:09:55,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55, skipping insertion in model container [2025-03-03 20:09:55,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:09:55,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-62.i[916,929] [2025-03-03 20:09:55,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:09:55,408 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:09:55,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-62.i[916,929] [2025-03-03 20:09:55,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:09:55,477 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:09:55,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55 WrapperNode [2025-03-03 20:09:55,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:09:55,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:09:55,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:09:55,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:09:55,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,588 INFO L138 Inliner]: procedures = 26, calls = 105, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 845 [2025-03-03 20:09:55,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:09:55,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:09:55,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:09:55,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:09:55,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,653 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:09:55,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:09:55,725 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:09:55,725 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:09:55,725 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:09:55,726 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (1/1) ... [2025-03-03 20:09:55,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:09:55,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:09:55,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:09:55,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:09:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:09:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:09:55,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:09:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:09:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:09:55,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:09:55,909 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:09:55,911 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:09:56,770 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L684: havoc property_#t~ite77#1;havoc property_#t~bitwise76#1;havoc property_#t~short78#1; [2025-03-03 20:09:56,939 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-03 20:09:56,939 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:09:56,971 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:09:56,971 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:09:56,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:09:56 BoogieIcfgContainer [2025-03-03 20:09:56,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:09:56,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:09:56,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:09:56,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:09:56,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:09:55" (1/3) ... [2025-03-03 20:09:56,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798f7d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:09:56, skipping insertion in model container [2025-03-03 20:09:56,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:09:55" (2/3) ... [2025-03-03 20:09:56,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798f7d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:09:56, skipping insertion in model container [2025-03-03 20:09:56,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:09:56" (3/3) ... [2025-03-03 20:09:56,978 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-62.i [2025-03-03 20:09:56,988 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:09:56,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-62.i that has 2 procedures, 349 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:09:57,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:09:57,053 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;@a0a603a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:09:57,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:09:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 254 states have (on average 1.6377952755905512) internal successors, (416), 255 states have internal predecessors, (416), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 20:09:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-03-03 20:09:57,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:57,078 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:57,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:57,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1597963378, now seen corresponding path program 1 times [2025-03-03 20:09:57,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:57,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729752042] [2025-03-03 20:09:57,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:57,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:57,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-03 20:09:57,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-03 20:09:57,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:57,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-03-03 20:09:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729752042] [2025-03-03 20:09:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729752042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:09:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340767317] [2025-03-03 20:09:57,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:57,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:09:57,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:09:57,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:09:57,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:09:57,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-03 20:09:57,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-03 20:09:57,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:57,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:57,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 1365 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:09:57,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:09:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-03-03 20:09:57,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:09:57,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340767317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:57,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:09:57,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:09:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115663420] [2025-03-03 20:09:57,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:57,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:09:57,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:57,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:09:57,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:09:58,000 INFO L87 Difference]: Start difference. First operand has 349 states, 254 states have (on average 1.6377952755905512) internal successors, (416), 255 states have internal predecessors, (416), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-03 20:09:58,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:58,072 INFO L93 Difference]: Finished difference Result 688 states and 1281 transitions. [2025-03-03 20:09:58,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:09:58,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) Word has length 598 [2025-03-03 20:09:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:58,082 INFO L225 Difference]: With dead ends: 688 [2025-03-03 20:09:58,082 INFO L226 Difference]: Without dead ends: 342 [2025-03-03 20:09:58,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:09:58,091 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:58,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 566 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:09:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-03 20:09:58,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-03-03 20:09:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 248 states have (on average 1.6209677419354838) internal successors, (402), 248 states have internal predecessors, (402), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 20:09:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 586 transitions. [2025-03-03 20:09:58,169 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 586 transitions. Word has length 598 [2025-03-03 20:09:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:58,171 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 586 transitions. [2025-03-03 20:09:58,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-03 20:09:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 586 transitions. [2025-03-03 20:09:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-03-03 20:09:58,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:58,185 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:58,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:09:58,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:09:58,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:58,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:58,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1092445362, now seen corresponding path program 1 times [2025-03-03 20:09:58,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:58,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103386339] [2025-03-03 20:09:58,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:58,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:58,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-03 20:09:58,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-03 20:09:58,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:58,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-03 20:09:59,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:59,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103386339] [2025-03-03 20:09:59,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103386339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:59,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:59,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:59,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809506621] [2025-03-03 20:09:59,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:59,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:59,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:59,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:59,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:59,039 INFO L87 Difference]: Start difference. First operand 342 states and 586 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:09:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:59,235 INFO L93 Difference]: Finished difference Result 901 states and 1554 transitions. [2025-03-03 20:09:59,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:59,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 598 [2025-03-03 20:09:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:59,246 INFO L225 Difference]: With dead ends: 901 [2025-03-03 20:09:59,248 INFO L226 Difference]: Without dead ends: 562 [2025-03-03 20:09:59,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:59,251 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 383 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:59,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1122 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:09:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-03 20:09:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 559. [2025-03-03 20:09:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 443 states have (on average 1.674943566591422) internal successors, (742), 444 states have internal predecessors, (742), 113 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-03 20:09:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 968 transitions. [2025-03-03 20:09:59,307 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 968 transitions. Word has length 598 [2025-03-03 20:09:59,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:59,308 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 968 transitions. [2025-03-03 20:09:59,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:09:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 968 transitions. [2025-03-03 20:09:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-03-03 20:09:59,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:59,318 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:59,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:09:59,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:59,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:59,320 INFO L85 PathProgramCache]: Analyzing trace with hash 521194129, now seen corresponding path program 1 times [2025-03-03 20:09:59,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:59,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71920185] [2025-03-03 20:09:59,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:59,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:59,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-03 20:09:59,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-03 20:09:59,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:59,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-03 20:09:59,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:59,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71920185] [2025-03-03 20:09:59,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71920185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:59,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:59,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:59,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23252018] [2025-03-03 20:09:59,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:59,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:59,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:59,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:59,679 INFO L87 Difference]: Start difference. First operand 559 states and 968 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:09:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:59,801 INFO L93 Difference]: Finished difference Result 1671 states and 2898 transitions. [2025-03-03 20:09:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:59,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 598 [2025-03-03 20:09:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:59,809 INFO L225 Difference]: With dead ends: 1671 [2025-03-03 20:09:59,809 INFO L226 Difference]: Without dead ends: 1115 [2025-03-03 20:09:59,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:59,812 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 395 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:59,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1216 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:09:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-03 20:09:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1113. [2025-03-03 20:09:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 882 states have (on average 1.6757369614512472) internal successors, (1478), 884 states have internal predecessors, (1478), 226 states have call successors, (226), 4 states have call predecessors, (226), 4 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-03 20:09:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1930 transitions. [2025-03-03 20:09:59,891 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1930 transitions. Word has length 598 [2025-03-03 20:09:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:59,892 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1930 transitions. [2025-03-03 20:09:59,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:09:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1930 transitions. [2025-03-03 20:09:59,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-03-03 20:09:59,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:59,897 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:09:59,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:09:59,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:59,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:59,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2145383368, now seen corresponding path program 1 times [2025-03-03 20:09:59,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:59,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100033700] [2025-03-03 20:09:59,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:59,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:59,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-03-03 20:09:59,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-03-03 20:09:59,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:59,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-03 20:10:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:00,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100033700] [2025-03-03 20:10:00,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100033700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:00,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:00,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:00,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276022736] [2025-03-03 20:10:00,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:00,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:00,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:00,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:00,135 INFO L87 Difference]: Start difference. First operand 1113 states and 1930 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:00,268 INFO L93 Difference]: Finished difference Result 3081 states and 5356 transitions. [2025-03-03 20:10:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:00,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 599 [2025-03-03 20:10:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:00,282 INFO L225 Difference]: With dead ends: 3081 [2025-03-03 20:10:00,283 INFO L226 Difference]: Without dead ends: 1971 [2025-03-03 20:10:00,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:00,289 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 339 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:00,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1107 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2025-03-03 20:10:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1967. [2025-03-03 20:10:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1636 states have (on average 1.6907090464547678) internal successors, (2766), 1642 states have internal predecessors, (2766), 322 states have call successors, (322), 8 states have call predecessors, (322), 8 states have return successors, (322), 316 states have call predecessors, (322), 322 states have call successors, (322) [2025-03-03 20:10:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3410 transitions. [2025-03-03 20:10:00,390 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3410 transitions. Word has length 599 [2025-03-03 20:10:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:00,391 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 3410 transitions. [2025-03-03 20:10:00,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3410 transitions. [2025-03-03 20:10:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-03-03 20:10:00,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:00,397 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:00,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:10:00,397 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:00,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1913183177, now seen corresponding path program 1 times [2025-03-03 20:10:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:00,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006256063] [2025-03-03 20:10:00,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:00,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:00,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-03-03 20:10:00,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-03-03 20:10:00,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:00,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-03 20:10:00,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:00,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006256063] [2025-03-03 20:10:00,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006256063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:00,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:00,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:00,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118529576] [2025-03-03 20:10:00,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:00,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:00,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:00,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:00,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:00,624 INFO L87 Difference]: Start difference. First operand 1967 states and 3410 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:00,801 INFO L93 Difference]: Finished difference Result 5623 states and 9724 transitions. [2025-03-03 20:10:00,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:00,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 599 [2025-03-03 20:10:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:00,820 INFO L225 Difference]: With dead ends: 5623 [2025-03-03 20:10:00,820 INFO L226 Difference]: Without dead ends: 3659 [2025-03-03 20:10:00,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:00,826 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 570 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:00,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1356 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3659 states. [2025-03-03 20:10:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3659 to 3657. [2025-03-03 20:10:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3657 states, 2996 states have (on average 1.6688918558077437) internal successors, (5000), 3008 states have internal predecessors, (5000), 644 states have call successors, (644), 16 states have call predecessors, (644), 16 states have return successors, (644), 632 states have call predecessors, (644), 644 states have call successors, (644) [2025-03-03 20:10:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 6288 transitions. [2025-03-03 20:10:01,041 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 6288 transitions. Word has length 599 [2025-03-03 20:10:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:01,042 INFO L471 AbstractCegarLoop]: Abstraction has 3657 states and 6288 transitions. [2025-03-03 20:10:01,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 6288 transitions. [2025-03-03 20:10:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-03-03 20:10:01,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:01,049 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:01,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:10:01,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:01,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1504358952, now seen corresponding path program 1 times [2025-03-03 20:10:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:01,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080773208] [2025-03-03 20:10:01,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:01,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:01,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-03-03 20:10:01,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-03-03 20:10:01,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:01,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-03 20:10:01,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:01,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080773208] [2025-03-03 20:10:01,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080773208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:01,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:01,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:10:01,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27245498] [2025-03-03 20:10:01,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:01,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:10:01,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:01,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:10:01,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:01,433 INFO L87 Difference]: Start difference. First operand 3657 states and 6288 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:01,731 INFO L93 Difference]: Finished difference Result 8323 states and 14031 transitions. [2025-03-03 20:10:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:10:01,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 599 [2025-03-03 20:10:01,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:01,762 INFO L225 Difference]: With dead ends: 8323 [2025-03-03 20:10:01,763 INFO L226 Difference]: Without dead ends: 4669 [2025-03-03 20:10:01,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:01,773 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 80 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:01,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1700 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2025-03-03 20:10:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4201. [2025-03-03 20:10:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4201 states, 3380 states have (on average 1.616568047337278) internal successors, (5464), 3408 states have internal predecessors, (5464), 788 states have call successors, (788), 32 states have call predecessors, (788), 32 states have return successors, (788), 760 states have call predecessors, (788), 788 states have call successors, (788) [2025-03-03 20:10:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 7040 transitions. [2025-03-03 20:10:02,027 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 7040 transitions. Word has length 599 [2025-03-03 20:10:02,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:02,028 INFO L471 AbstractCegarLoop]: Abstraction has 4201 states and 7040 transitions. [2025-03-03 20:10:02,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 7040 transitions. [2025-03-03 20:10:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-03-03 20:10:02,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:02,036 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:02,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:10:02,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:02,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash -616855271, now seen corresponding path program 1 times [2025-03-03 20:10:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:02,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666744111] [2025-03-03 20:10:02,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:02,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:02,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-03-03 20:10:02,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-03-03 20:10:02,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:02,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-03 20:10:02,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666744111] [2025-03-03 20:10:02,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666744111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:02,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:02,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:10:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635135392] [2025-03-03 20:10:02,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:02,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:10:02,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:02,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:10:02,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:02,561 INFO L87 Difference]: Start difference. First operand 4201 states and 7040 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:03,248 INFO L93 Difference]: Finished difference Result 12613 states and 21146 transitions. [2025-03-03 20:10:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:10:03,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 599 [2025-03-03 20:10:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:03,290 INFO L225 Difference]: With dead ends: 12613 [2025-03-03 20:10:03,290 INFO L226 Difference]: Without dead ends: 8415 [2025-03-03 20:10:03,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:03,301 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 409 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:03,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1410 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:10:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8415 states. [2025-03-03 20:10:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8415 to 8401. [2025-03-03 20:10:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8401 states, 6760 states have (on average 1.614792899408284) internal successors, (10916), 6816 states have internal predecessors, (10916), 1576 states have call successors, (1576), 64 states have call predecessors, (1576), 64 states have return successors, (1576), 1520 states have call predecessors, (1576), 1576 states have call successors, (1576) [2025-03-03 20:10:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8401 states to 8401 states and 14068 transitions. [2025-03-03 20:10:03,846 INFO L78 Accepts]: Start accepts. Automaton has 8401 states and 14068 transitions. Word has length 599 [2025-03-03 20:10:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:03,848 INFO L471 AbstractCegarLoop]: Abstraction has 8401 states and 14068 transitions. [2025-03-03 20:10:03,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 8401 states and 14068 transitions. [2025-03-03 20:10:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-03-03 20:10:03,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:03,865 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:03,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:10:03,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:03,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash -596517896, now seen corresponding path program 1 times [2025-03-03 20:10:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:03,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358049739] [2025-03-03 20:10:03,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:03,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-03-03 20:10:03,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-03-03 20:10:03,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:03,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-03 20:10:04,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:04,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358049739] [2025-03-03 20:10:04,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358049739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:04,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:04,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:10:04,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653452591] [2025-03-03 20:10:04,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:04,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:10:04,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:04,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:10:04,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:10:04,495 INFO L87 Difference]: Start difference. First operand 8401 states and 14068 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:07,074 INFO L93 Difference]: Finished difference Result 38475 states and 63601 transitions. [2025-03-03 20:10:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:10:07,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 599 [2025-03-03 20:10:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:07,189 INFO L225 Difference]: With dead ends: 38475 [2025-03-03 20:10:07,190 INFO L226 Difference]: Without dead ends: 30077 [2025-03-03 20:10:07,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:10:07,225 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1717 mSDsluCounter, 2740 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 708 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 3539 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 708 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:07,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 3539 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [708 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:10:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30077 states. [2025-03-03 20:10:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30077 to 21329. [2025-03-03 20:10:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21329 states, 17444 states have (on average 1.6230222426049072) internal successors, (28312), 17592 states have internal predecessors, (28312), 3724 states have call successors, (3724), 160 states have call predecessors, (3724), 160 states have return successors, (3724), 3576 states have call predecessors, (3724), 3724 states have call successors, (3724) [2025-03-03 20:10:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21329 states to 21329 states and 35760 transitions. [2025-03-03 20:10:08,595 INFO L78 Accepts]: Start accepts. Automaton has 21329 states and 35760 transitions. Word has length 599 [2025-03-03 20:10:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:08,596 INFO L471 AbstractCegarLoop]: Abstraction has 21329 states and 35760 transitions. [2025-03-03 20:10:08,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 21329 states and 35760 transitions. [2025-03-03 20:10:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-03-03 20:10:08,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:08,619 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:08,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:10:08,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1688345559, now seen corresponding path program 1 times [2025-03-03 20:10:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:08,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983057740] [2025-03-03 20:10:08,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:08,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:08,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-03-03 20:10:08,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-03-03 20:10:08,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:08,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:08,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-03 20:10:08,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:08,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983057740] [2025-03-03 20:10:08,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983057740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:08,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:08,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:10:08,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250827924] [2025-03-03 20:10:08,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:08,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:10:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:08,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:10:08,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:10:08,997 INFO L87 Difference]: Start difference. First operand 21329 states and 35760 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:15,699 INFO L93 Difference]: Finished difference Result 143629 states and 234796 transitions. [2025-03-03 20:10:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 20:10:15,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 599 [2025-03-03 20:10:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:16,172 INFO L225 Difference]: With dead ends: 143629 [2025-03-03 20:10:16,172 INFO L226 Difference]: Without dead ends: 122047 [2025-03-03 20:10:16,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:10:16,265 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 2136 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2136 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:16,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2136 Valid, 3121 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 20:10:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122047 states. [2025-03-03 20:10:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122047 to 60581. [2025-03-03 20:10:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60581 states, 50044 states have (on average 1.6200143873391415) internal successors, (81072), 50512 states have internal predecessors, (81072), 10044 states have call successors, (10044), 492 states have call predecessors, (10044), 492 states have return successors, (10044), 9576 states have call predecessors, (10044), 10044 states have call successors, (10044) [2025-03-03 20:10:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60581 states to 60581 states and 101160 transitions. [2025-03-03 20:10:20,240 INFO L78 Accepts]: Start accepts. Automaton has 60581 states and 101160 transitions. Word has length 599 [2025-03-03 20:10:20,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:20,241 INFO L471 AbstractCegarLoop]: Abstraction has 60581 states and 101160 transitions. [2025-03-03 20:10:20,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 60581 states and 101160 transitions. [2025-03-03 20:10:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-03-03 20:10:20,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:20,298 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:20,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:10:20,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:20,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:20,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1500326984, now seen corresponding path program 1 times [2025-03-03 20:10:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:20,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770234095] [2025-03-03 20:10:20,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:20,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:20,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-03-03 20:10:20,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-03-03 20:10:20,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:20,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-03 20:10:21,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:21,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770234095] [2025-03-03 20:10:21,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770234095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:21,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:21,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:10:21,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486509544] [2025-03-03 20:10:21,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:21,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:10:21,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:21,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:10:21,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:21,096 INFO L87 Difference]: Start difference. First operand 60581 states and 101160 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:27,205 INFO L93 Difference]: Finished difference Result 174449 states and 288915 transitions. [2025-03-03 20:10:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:10:27,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 599 [2025-03-03 20:10:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:27,565 INFO L225 Difference]: With dead ends: 174449 [2025-03-03 20:10:27,566 INFO L226 Difference]: Without dead ends: 113871 [2025-03-03 20:10:27,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:10:27,708 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 3013 mSDsluCounter, 2544 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3013 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:27,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3013 Valid, 3339 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [762 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 20:10:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113871 states. [2025-03-03 20:10:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113871 to 66668. [2025-03-03 20:10:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66668 states, 56084 states have (on average 1.6385421867199201) internal successors, (91896), 56553 states have internal predecessors, (91896), 10089 states have call successors, (10089), 494 states have call predecessors, (10089), 494 states have return successors, (10089), 9620 states have call predecessors, (10089), 10089 states have call successors, (10089) [2025-03-03 20:10:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66668 states to 66668 states and 112074 transitions. [2025-03-03 20:10:31,041 INFO L78 Accepts]: Start accepts. Automaton has 66668 states and 112074 transitions. Word has length 599 [2025-03-03 20:10:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:31,042 INFO L471 AbstractCegarLoop]: Abstraction has 66668 states and 112074 transitions. [2025-03-03 20:10:31,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 66668 states and 112074 transitions. [2025-03-03 20:10:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-03-03 20:10:31,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:31,090 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:31,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:10:31,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:31,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash 172652119, now seen corresponding path program 1 times [2025-03-03 20:10:31,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:31,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693172680] [2025-03-03 20:10:31,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:31,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:31,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-03-03 20:10:31,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-03-03 20:10:31,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:31,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-03 20:10:32,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:32,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693172680] [2025-03-03 20:10:32,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693172680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:32,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:32,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:10:32,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658881875] [2025-03-03 20:10:32,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:32,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:10:32,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:32,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:10:32,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:32,257 INFO L87 Difference]: Start difference. First operand 66668 states and 112074 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-03 20:10:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:43,564 INFO L93 Difference]: Finished difference Result 302314 states and 507863 transitions. [2025-03-03 20:10:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:10:43,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 599 [2025-03-03 20:10:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:44,194 INFO L225 Difference]: With dead ends: 302314 [2025-03-03 20:10:44,194 INFO L226 Difference]: Without dead ends: 235728 [2025-03-03 20:10:44,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:10:44,336 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 2471 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2471 SdHoareTripleChecker+Valid, 3164 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:44,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2471 Valid, 3164 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 20:10:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235728 states.