./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.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 c28c916d59e15fbb84eacdc574b21cac712312e1644083eaa396f6071a295218 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:47:01,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:47:02,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:47:02,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:47:02,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:47:02,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:47:02,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:47:02,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:47:02,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:47:02,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:47:02,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:47:02,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:47:02,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:47:02,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:47:02,032 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:47:02,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:47:02,033 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:47:02,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:47:02,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:47:02,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:47:02,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:47:02,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:47:02,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:47:02,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:47:02,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:47:02,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:47:02,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:47:02,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:47:02,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:47:02,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:47:02,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:47:02,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:47:02,035 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 -> c28c916d59e15fbb84eacdc574b21cac712312e1644083eaa396f6071a295218 [2025-03-17 00:47:02,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:47:02,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:47:02,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:47:02,312 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:47:02,313 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:47:02,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i [2025-03-17 00:47:03,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9946919f0/b32aa0048ec7469faade3324cd21d346/FLAG9fa1b1ce2 [2025-03-17 00:47:03,702 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:47:03,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i [2025-03-17 00:47:03,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9946919f0/b32aa0048ec7469faade3324cd21d346/FLAG9fa1b1ce2 [2025-03-17 00:47:04,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9946919f0/b32aa0048ec7469faade3324cd21d346 [2025-03-17 00:47:04,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:47:04,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:47:04,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:47:04,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:47:04,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:47:04,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3137b067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04, skipping insertion in model container [2025-03-17 00:47:04,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:47:04,151 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_fillercodestructure_filler-pe-ci_file-34.i[919,932] [2025-03-17 00:47:04,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:47:04,224 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:47:04,233 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_fillercodestructure_filler-pe-ci_file-34.i[919,932] [2025-03-17 00:47:04,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:47:04,282 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:47:04,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04 WrapperNode [2025-03-17 00:47:04,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:47:04,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:47:04,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:47:04,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:47:04,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,338 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2025-03-17 00:47:04,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:47:04,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:47:04,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:47:04,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:47:04,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,386 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:47:04,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:47:04,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:47:04,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:47:04,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:47:04,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (1/1) ... [2025-03-17 00:47:04,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:47:04,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:47:04,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:47:04,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:47:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:47:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:47:04,454 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:47:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:47:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:47:04,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:47:04,525 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:47:04,527 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:47:04,930 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2025-03-17 00:47:04,958 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-17 00:47:04,958 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:47:04,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:47:04,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:47:04,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:47:04 BoogieIcfgContainer [2025-03-17 00:47:04,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:47:04,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:47:04,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:47:04,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:47:04,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:47:04" (1/3) ... [2025-03-17 00:47:04,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4259b629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:47:04, skipping insertion in model container [2025-03-17 00:47:04,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:04" (2/3) ... [2025-03-17 00:47:04,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4259b629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:47:04, skipping insertion in model container [2025-03-17 00:47:04,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:47:04" (3/3) ... [2025-03-17 00:47:04,986 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i [2025-03-17 00:47:04,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:47:04,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:47:05,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:47:05,048 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;@5bd7f962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:47:05,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:47:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 66 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 00:47:05,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 00:47:05,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:05,064 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:05,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:05,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:05,068 INFO L85 PathProgramCache]: Analyzing trace with hash -184403318, now seen corresponding path program 1 times [2025-03-17 00:47:05,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:05,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673756038] [2025-03-17 00:47:05,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:05,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:05,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 00:47:05,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 00:47:05,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:05,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 00:47:05,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:05,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673756038] [2025-03-17 00:47:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673756038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:47:05,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476884571] [2025-03-17 00:47:05,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:05,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:47:05,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:47:05,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:47:05,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:47:05,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 00:47:05,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 00:47:05,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:05,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:05,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:47:05,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:47:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 00:47:05,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:47:05,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476884571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:05,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:47:05,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:47:05,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714551969] [2025-03-17 00:47:05,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:05,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:47:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:05,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:47:05,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:47:05,574 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 66 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 00:47:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:05,606 INFO L93 Difference]: Finished difference Result 173 states and 298 transitions. [2025-03-17 00:47:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:47:05,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 138 [2025-03-17 00:47:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:05,615 INFO L225 Difference]: With dead ends: 173 [2025-03-17 00:47:05,616 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 00:47:05,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:47:05,622 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:05,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:47:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 00:47:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 00:47:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.5) internal successors, (96), 64 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 00:47:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 136 transitions. [2025-03-17 00:47:05,662 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 136 transitions. Word has length 138 [2025-03-17 00:47:05,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:05,662 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 136 transitions. [2025-03-17 00:47:05,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 00:47:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 136 transitions. [2025-03-17 00:47:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 00:47:05,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:05,665 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:05,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:47:05,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:47:05,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:05,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1191919148, now seen corresponding path program 1 times [2025-03-17 00:47:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:05,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391865946] [2025-03-17 00:47:05,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:05,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:05,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 00:47:05,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 00:47:05,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:05,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:47:06,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:06,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391865946] [2025-03-17 00:47:06,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391865946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:06,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:06,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:47:06,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980085459] [2025-03-17 00:47:06,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:06,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:47:06,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:06,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:47:06,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:47:06,340 INFO L87 Difference]: Start difference. First operand 86 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:06,491 INFO L93 Difference]: Finished difference Result 296 states and 470 transitions. [2025-03-17 00:47:06,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:47:06,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2025-03-17 00:47:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:06,493 INFO L225 Difference]: With dead ends: 296 [2025-03-17 00:47:06,493 INFO L226 Difference]: Without dead ends: 211 [2025-03-17 00:47:06,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:47:06,496 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 169 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:06,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 435 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:47:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-17 00:47:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 171. [2025-03-17 00:47:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 128 states have (on average 1.4921875) internal successors, (191), 128 states have internal predecessors, (191), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 00:47:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 271 transitions. [2025-03-17 00:47:06,519 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 271 transitions. Word has length 138 [2025-03-17 00:47:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:06,520 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 271 transitions. [2025-03-17 00:47:06,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 271 transitions. [2025-03-17 00:47:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 00:47:06,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:06,521 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:06,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:47:06,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:06,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:06,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1239643039, now seen corresponding path program 1 times [2025-03-17 00:47:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:06,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38061034] [2025-03-17 00:47:06,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:06,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:06,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 00:47:06,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 00:47:06,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:06,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:47:06,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:06,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38061034] [2025-03-17 00:47:06,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38061034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:06,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:06,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:47:06,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76871025] [2025-03-17 00:47:06,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:06,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:47:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:06,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:47:06,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:47:06,857 INFO L87 Difference]: Start difference. First operand 171 states and 271 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:07,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:07,116 INFO L93 Difference]: Finished difference Result 506 states and 800 transitions. [2025-03-17 00:47:07,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:47:07,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2025-03-17 00:47:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:07,121 INFO L225 Difference]: With dead ends: 506 [2025-03-17 00:47:07,121 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 00:47:07,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:47:07,125 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 218 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:07,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 455 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:47:07,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 00:47:07,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 175. [2025-03-17 00:47:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 00:47:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 275 transitions. [2025-03-17 00:47:07,163 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 275 transitions. Word has length 139 [2025-03-17 00:47:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:07,165 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 275 transitions. [2025-03-17 00:47:07,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 275 transitions. [2025-03-17 00:47:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:47:07,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:07,167 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:07,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:47:07,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:07,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash -161690768, now seen corresponding path program 1 times [2025-03-17 00:47:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772359127] [2025-03-17 00:47:07,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:07,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:47:07,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:47:07,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:07,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:47:07,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:07,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772359127] [2025-03-17 00:47:07,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772359127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:07,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:07,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:47:07,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309287372] [2025-03-17 00:47:07,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:07,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:47:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:07,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:47:07,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:47:07,676 INFO L87 Difference]: Start difference. First operand 175 states and 275 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:07,947 INFO L93 Difference]: Finished difference Result 477 states and 749 transitions. [2025-03-17 00:47:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:47:07,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 00:47:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:07,949 INFO L225 Difference]: With dead ends: 477 [2025-03-17 00:47:07,949 INFO L226 Difference]: Without dead ends: 303 [2025-03-17 00:47:07,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:47:07,951 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 103 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:07,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 333 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:47:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-17 00:47:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 227. [2025-03-17 00:47:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 163 states have (on average 1.4355828220858895) internal successors, (234), 163 states have internal predecessors, (234), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 00:47:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 354 transitions. [2025-03-17 00:47:07,994 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 354 transitions. Word has length 140 [2025-03-17 00:47:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:07,994 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 354 transitions. [2025-03-17 00:47:07,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 354 transitions. [2025-03-17 00:47:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:47:08,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:08,001 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:08,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:47:08,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:08,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash -373041681, now seen corresponding path program 1 times [2025-03-17 00:47:08,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:08,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697176242] [2025-03-17 00:47:08,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:08,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:08,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:47:08,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:47:08,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:08,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:47:10,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:10,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697176242] [2025-03-17 00:47:10,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697176242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:10,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:10,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:47:10,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840112394] [2025-03-17 00:47:10,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:10,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:47:10,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:10,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:47:10,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:47:10,005 INFO L87 Difference]: Start difference. First operand 227 states and 354 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:10,503 INFO L93 Difference]: Finished difference Result 505 states and 797 transitions. [2025-03-17 00:47:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:47:10,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 00:47:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:10,506 INFO L225 Difference]: With dead ends: 505 [2025-03-17 00:47:10,506 INFO L226 Difference]: Without dead ends: 331 [2025-03-17 00:47:10,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:47:10,509 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 247 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:10,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 441 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:47:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-17 00:47:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 233. [2025-03-17 00:47:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 169 states have (on average 1.4319526627218935) internal successors, (242), 169 states have internal predecessors, (242), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 00:47:10,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2025-03-17 00:47:10,554 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 140 [2025-03-17 00:47:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:10,555 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2025-03-17 00:47:10,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2025-03-17 00:47:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:47:10,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:10,558 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:10,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:47:10,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:10,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 598686644, now seen corresponding path program 1 times [2025-03-17 00:47:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:10,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900136227] [2025-03-17 00:47:10,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:10,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:47:10,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:47:10,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:10,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:47:13,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:13,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900136227] [2025-03-17 00:47:13,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900136227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:13,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:13,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 00:47:13,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226184736] [2025-03-17 00:47:13,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:13,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:47:13,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:13,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:47:13,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:47:13,089 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:14,284 INFO L93 Difference]: Finished difference Result 755 states and 1175 transitions. [2025-03-17 00:47:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:47:14,285 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 00:47:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:14,288 INFO L225 Difference]: With dead ends: 755 [2025-03-17 00:47:14,291 INFO L226 Difference]: Without dead ends: 581 [2025-03-17 00:47:14,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:47:14,292 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 410 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:14,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 665 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 00:47:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-17 00:47:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 360. [2025-03-17 00:47:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 284 states have (on average 1.4683098591549295) internal successors, (417), 286 states have internal predecessors, (417), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:47:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 557 transitions. [2025-03-17 00:47:14,326 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 557 transitions. Word has length 140 [2025-03-17 00:47:14,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:14,326 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 557 transitions. [2025-03-17 00:47:14,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 557 transitions. [2025-03-17 00:47:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:47:14,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:14,328 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:14,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:47:14,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:14,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash 93128019, now seen corresponding path program 1 times [2025-03-17 00:47:14,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:14,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438916961] [2025-03-17 00:47:14,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:14,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:47:14,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:47:14,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:14,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:47:16,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:16,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438916961] [2025-03-17 00:47:16,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438916961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:16,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:16,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:47:16,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770059503] [2025-03-17 00:47:16,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:16,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:47:16,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:16,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:47:16,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:47:16,108 INFO L87 Difference]: Start difference. First operand 360 states and 557 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:16,998 INFO L93 Difference]: Finished difference Result 1042 states and 1612 transitions. [2025-03-17 00:47:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:47:16,998 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 00:47:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:17,002 INFO L225 Difference]: With dead ends: 1042 [2025-03-17 00:47:17,002 INFO L226 Difference]: Without dead ends: 745 [2025-03-17 00:47:17,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:47:17,004 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 389 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:17,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 488 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:47:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-17 00:47:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 429. [2025-03-17 00:47:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 353 states have (on average 1.4305949008498584) internal successors, (505), 355 states have internal predecessors, (505), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:47:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 645 transitions. [2025-03-17 00:47:17,039 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 645 transitions. Word has length 140 [2025-03-17 00:47:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:17,039 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 645 transitions. [2025-03-17 00:47:17,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 645 transitions. [2025-03-17 00:47:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:47:17,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:17,041 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:17,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:47:17,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:17,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash 88152467, now seen corresponding path program 1 times [2025-03-17 00:47:17,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:17,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009251453] [2025-03-17 00:47:17,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:17,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:17,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:47:17,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:47:17,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:17,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:47:19,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009251453] [2025-03-17 00:47:19,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009251453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:19,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:19,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:47:19,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280424347] [2025-03-17 00:47:19,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:19,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:47:19,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:19,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:47:19,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:47:19,270 INFO L87 Difference]: Start difference. First operand 429 states and 645 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 00:47:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:20,037 INFO L93 Difference]: Finished difference Result 1179 states and 1771 transitions. [2025-03-17 00:47:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:47:20,040 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2025-03-17 00:47:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:20,043 INFO L225 Difference]: With dead ends: 1179 [2025-03-17 00:47:20,043 INFO L226 Difference]: Without dead ends: 817 [2025-03-17 00:47:20,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-17 00:47:20,045 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 514 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:20,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 593 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:47:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-03-17 00:47:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 653. [2025-03-17 00:47:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 577 states have (on average 1.488734835355286) internal successors, (859), 579 states have internal predecessors, (859), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:47:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 999 transitions. [2025-03-17 00:47:20,084 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 999 transitions. Word has length 140 [2025-03-17 00:47:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:20,084 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 999 transitions. [2025-03-17 00:47:20,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 00:47:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 999 transitions. [2025-03-17 00:47:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 00:47:20,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:20,087 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:20,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:47:20,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:20,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1843451125, now seen corresponding path program 1 times [2025-03-17 00:47:20,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:20,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826308804] [2025-03-17 00:47:20,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:20,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:20,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 00:47:20,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 00:47:20,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:20,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:47:23,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:23,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826308804] [2025-03-17 00:47:23,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826308804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:23,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:23,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 00:47:23,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548535855] [2025-03-17 00:47:23,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:23,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:47:23,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:23,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:47:23,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:47:23,342 INFO L87 Difference]: Start difference. First operand 653 states and 999 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:25,107 INFO L93 Difference]: Finished difference Result 992 states and 1523 transitions. [2025-03-17 00:47:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:47:25,107 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 00:47:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:25,110 INFO L225 Difference]: With dead ends: 992 [2025-03-17 00:47:25,110 INFO L226 Difference]: Without dead ends: 813 [2025-03-17 00:47:25,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-03-17 00:47:25,115 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 555 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:25,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 946 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:47:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-03-17 00:47:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 704. [2025-03-17 00:47:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 628 states have (on average 1.4856687898089171) internal successors, (933), 630 states have internal predecessors, (933), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:47:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1073 transitions. [2025-03-17 00:47:25,152 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1073 transitions. Word has length 140 [2025-03-17 00:47:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:25,152 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1073 transitions. [2025-03-17 00:47:25,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1073 transitions. [2025-03-17 00:47:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 00:47:25,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:25,156 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:25,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:47:25,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:25,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1689891428, now seen corresponding path program 1 times [2025-03-17 00:47:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:25,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179113293] [2025-03-17 00:47:25,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:25,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 00:47:25,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 00:47:25,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:25,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:47:37,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:37,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179113293] [2025-03-17 00:47:37,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179113293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:37,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:37,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 00:47:37,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817107531] [2025-03-17 00:47:37,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:37,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:47:37,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:37,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:47:37,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:47:37,278 INFO L87 Difference]: Start difference. First operand 704 states and 1073 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:37,896 INFO L93 Difference]: Finished difference Result 1578 states and 2464 transitions. [2025-03-17 00:47:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:47:37,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 00:47:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:37,901 INFO L225 Difference]: With dead ends: 1578 [2025-03-17 00:47:37,901 INFO L226 Difference]: Without dead ends: 1225 [2025-03-17 00:47:37,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:47:37,903 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 393 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:37,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 842 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:47:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-17 00:47:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 684. [2025-03-17 00:47:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 613 states have (on average 1.4828711256117455) internal successors, (909), 614 states have internal predecessors, (909), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 00:47:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1039 transitions. [2025-03-17 00:47:37,935 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1039 transitions. Word has length 141 [2025-03-17 00:47:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:37,935 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1039 transitions. [2025-03-17 00:47:37,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1039 transitions. [2025-03-17 00:47:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 00:47:37,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:37,937 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:37,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:47:37,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:37,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:37,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1622884675, now seen corresponding path program 1 times [2025-03-17 00:47:37,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:37,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928883491] [2025-03-17 00:47:37,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:37,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 00:47:37,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 00:47:37,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:37,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:47:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928883491] [2025-03-17 00:47:38,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928883491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:38,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:38,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:47:38,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861743402] [2025-03-17 00:47:38,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:38,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:47:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:38,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:47:38,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:47:38,947 INFO L87 Difference]: Start difference. First operand 684 states and 1039 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:39,608 INFO L93 Difference]: Finished difference Result 1105 states and 1704 transitions. [2025-03-17 00:47:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:47:39,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 00:47:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:39,612 INFO L225 Difference]: With dead ends: 1105 [2025-03-17 00:47:39,612 INFO L226 Difference]: Without dead ends: 918 [2025-03-17 00:47:39,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:47:39,614 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 411 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:39,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1123 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:47:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-03-17 00:47:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 771. [2025-03-17 00:47:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 684 states have (on average 1.476608187134503) internal successors, (1010), 684 states have internal predecessors, (1010), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:47:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1170 transitions. [2025-03-17 00:47:39,648 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1170 transitions. Word has length 141 [2025-03-17 00:47:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:39,649 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1170 transitions. [2025-03-17 00:47:39,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1170 transitions. [2025-03-17 00:47:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 00:47:39,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:39,651 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:39,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:47:39,652 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:39,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1235652713, now seen corresponding path program 1 times [2025-03-17 00:47:39,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:39,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155817047] [2025-03-17 00:47:39,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:39,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:39,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 00:47:39,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 00:47:39,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:39,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:47:46,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:46,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155817047] [2025-03-17 00:47:46,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155817047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:46,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:46,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 00:47:46,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266110478] [2025-03-17 00:47:46,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:46,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:47:46,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:46,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:47:46,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:47:46,286 INFO L87 Difference]: Start difference. First operand 771 states and 1170 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:48,286 INFO L93 Difference]: Finished difference Result 1822 states and 2753 transitions. [2025-03-17 00:47:48,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 00:47:48,287 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 00:47:48,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:48,291 INFO L225 Difference]: With dead ends: 1822 [2025-03-17 00:47:48,291 INFO L226 Difference]: Without dead ends: 1183 [2025-03-17 00:47:48,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2025-03-17 00:47:48,293 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 358 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:48,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 959 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 00:47:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-17 00:47:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 885. [2025-03-17 00:47:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 798 states have (on average 1.4912280701754386) internal successors, (1190), 798 states have internal predecessors, (1190), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:47:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1350 transitions. [2025-03-17 00:47:48,325 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1350 transitions. Word has length 141 [2025-03-17 00:47:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:48,326 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1350 transitions. [2025-03-17 00:47:48,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:47:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1350 transitions. [2025-03-17 00:47:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 00:47:48,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:48,328 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:47:48,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:47:48,328 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:48,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1882835728, now seen corresponding path program 1 times [2025-03-17 00:47:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365981930] [2025-03-17 00:47:48,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:48,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:48,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 00:47:48,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 00:47:48,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:48,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:48:05,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:05,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365981930] [2025-03-17 00:48:05,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365981930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:05,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:05,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 00:48:05,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123879774] [2025-03-17 00:48:05,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:05,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 00:48:05,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:05,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 00:48:05,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-03-17 00:48:05,079 INFO L87 Difference]: Start difference. First operand 885 states and 1350 transitions. Second operand has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 00:48:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:07,668 INFO L93 Difference]: Finished difference Result 1578 states and 2404 transitions. [2025-03-17 00:48:07,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 00:48:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2025-03-17 00:48:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:07,672 INFO L225 Difference]: With dead ends: 1578 [2025-03-17 00:48:07,672 INFO L226 Difference]: Without dead ends: 1200 [2025-03-17 00:48:07,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 00:48:07,674 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 909 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:07,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 947 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 00:48:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2025-03-17 00:48:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 975. [2025-03-17 00:48:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 888 states have (on average 1.4932432432432432) internal successors, (1326), 888 states have internal predecessors, (1326), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:48:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1486 transitions. [2025-03-17 00:48:07,705 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1486 transitions. Word has length 142 [2025-03-17 00:48:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:07,706 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1486 transitions. [2025-03-17 00:48:07,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 00:48:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1486 transitions. [2025-03-17 00:48:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 00:48:07,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:07,707 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:48:07,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:48:07,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:07,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1372301551, now seen corresponding path program 1 times [2025-03-17 00:48:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941010627] [2025-03-17 00:48:07,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:07,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 00:48:07,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 00:48:07,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:07,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:48:09,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:09,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941010627] [2025-03-17 00:48:09,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941010627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:09,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:09,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 00:48:09,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528337886] [2025-03-17 00:48:09,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:09,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:48:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:09,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:48:09,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:48:09,648 INFO L87 Difference]: Start difference. First operand 975 states and 1486 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 00:48:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:10,478 INFO L93 Difference]: Finished difference Result 1573 states and 2377 transitions. [2025-03-17 00:48:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:48:10,478 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2025-03-17 00:48:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:10,481 INFO L225 Difference]: With dead ends: 1573 [2025-03-17 00:48:10,481 INFO L226 Difference]: Without dead ends: 1061 [2025-03-17 00:48:10,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-17 00:48:10,484 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 691 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:10,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 556 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:48:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-17 00:48:10,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 934. [2025-03-17 00:48:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 847 states have (on average 1.4864226682408501) internal successors, (1259), 847 states have internal predecessors, (1259), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:48:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1419 transitions. [2025-03-17 00:48:10,514 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1419 transitions. Word has length 142 [2025-03-17 00:48:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:10,514 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1419 transitions. [2025-03-17 00:48:10,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 00:48:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1419 transitions. [2025-03-17 00:48:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 00:48:10,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:10,516 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:48:10,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 00:48:10,516 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:10,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash -194373615, now seen corresponding path program 1 times [2025-03-17 00:48:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314869230] [2025-03-17 00:48:10,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:10,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 00:48:10,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 00:48:10,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:10,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:48:13,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314869230] [2025-03-17 00:48:13,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314869230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:13,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:13,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 00:48:13,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123019865] [2025-03-17 00:48:13,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:13,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 00:48:13,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:13,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 00:48:13,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:48:13,957 INFO L87 Difference]: Start difference. First operand 934 states and 1419 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:48:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:15,906 INFO L93 Difference]: Finished difference Result 1313 states and 1991 transitions. [2025-03-17 00:48:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 00:48:15,907 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-03-17 00:48:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:15,910 INFO L225 Difference]: With dead ends: 1313 [2025-03-17 00:48:15,910 INFO L226 Difference]: Without dead ends: 1086 [2025-03-17 00:48:15,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2025-03-17 00:48:15,912 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 490 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:15,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 942 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:48:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2025-03-17 00:48:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 944. [2025-03-17 00:48:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 857 states have (on average 1.4865810968494748) internal successors, (1274), 857 states have internal predecessors, (1274), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:48:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1434 transitions. [2025-03-17 00:48:15,947 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1434 transitions. Word has length 142 [2025-03-17 00:48:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:15,947 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1434 transitions. [2025-03-17 00:48:15,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 00:48:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1434 transitions. [2025-03-17 00:48:15,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 00:48:15,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:15,949 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:48:15,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 00:48:15,949 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:15,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash -237669845, now seen corresponding path program 1 times [2025-03-17 00:48:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743987311] [2025-03-17 00:48:15,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:15,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 00:48:16,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 00:48:16,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:16,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 00:48:28,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743987311] [2025-03-17 00:48:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743987311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:28,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 00:48:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196959578] [2025-03-17 00:48:28,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:28,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:48:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:28,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:48:28,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:48:28,873 INFO L87 Difference]: Start difference. First operand 944 states and 1434 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)