./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-97.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 02165d2842f12d5b69765c0782f17776c7bdb8b210882abfa812daaf9c359651 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:53:20,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:53:20,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:53:20,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:53:20,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:53:20,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:53:20,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:53:20,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:53:20,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:53:20,174 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:53:20,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:53:20,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:53:20,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:53:20,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:53:20,175 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:53:20,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:53:20,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:53:20,175 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:53:20,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:53:20,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:53:20,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:53:20,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:53:20,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:53:20,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:53:20,176 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:53:20,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:53:20,176 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:53:20,176 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:53:20,176 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:53:20,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:53:20,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:53:20,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:53:20,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:53:20,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:53:20,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:53:20,177 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:53:20,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:53:20,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:53:20,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:53:20,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:53:20,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:53:20,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:53:20,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:53:20,178 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 -> 02165d2842f12d5b69765c0782f17776c7bdb8b210882abfa812daaf9c359651 [2025-03-03 19:53:20,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:53:20,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:53:20,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:53:20,419 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:53:20,419 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:53:20,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-97.i [2025-03-03 19:53:21,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51cb21a5a/a8053f6fc6574b4993ef54ae46624896/FLAGbbe4603a4 [2025-03-03 19:53:21,820 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:53:21,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-97.i [2025-03-03 19:53:21,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51cb21a5a/a8053f6fc6574b4993ef54ae46624896/FLAGbbe4603a4 [2025-03-03 19:53:22,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51cb21a5a/a8053f6fc6574b4993ef54ae46624896 [2025-03-03 19:53:22,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:53:22,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:53:22,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:53:22,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:53:22,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:53:22,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4478fc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22, skipping insertion in model container [2025-03-03 19:53:22,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:53:22,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-97.i[916,929] [2025-03-03 19:53:22,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:53:22,345 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:53:22,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-97.i[916,929] [2025-03-03 19:53:22,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:53:22,418 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:53:22,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22 WrapperNode [2025-03-03 19:53:22,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:53:22,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:53:22,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:53:22,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:53:22,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,483 INFO L138 Inliner]: procedures = 26, calls = 97, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 614 [2025-03-03 19:53:22,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:53:22,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:53:22,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:53:22,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:53:22,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,527 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:53:22,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:53:22,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:53:22,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:53:22,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:53:22,573 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (1/1) ... [2025-03-03 19:53:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:53:22,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:53:22,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:53:22,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:53:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:53:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:53:22,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:53:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:53:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:53:22,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:53:22,710 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:53:22,712 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:53:23,419 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L454: havoc property_#t~ite63#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short64#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short67#1; [2025-03-03 19:53:23,517 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-03 19:53:23,517 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:53:23,547 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:53:23,550 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:53:23,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:53:23 BoogieIcfgContainer [2025-03-03 19:53:23,551 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:53:23,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:53:23,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:53:23,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:53:23,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:53:22" (1/3) ... [2025-03-03 19:53:23,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d144fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:53:23, skipping insertion in model container [2025-03-03 19:53:23,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:53:22" (2/3) ... [2025-03-03 19:53:23,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d144fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:53:23, skipping insertion in model container [2025-03-03 19:53:23,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:53:23" (3/3) ... [2025-03-03 19:53:23,559 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-97.i [2025-03-03 19:53:23,587 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:53:23,589 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-97.i that has 2 procedures, 256 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:53:23,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:53:23,648 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;@37903623, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:53:23,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:53:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 256 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 170 states have internal predecessors, (257), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 19:53:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-03-03 19:53:23,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:23,679 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:23,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:23,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash 719157468, now seen corresponding path program 1 times [2025-03-03 19:53:23,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:23,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884977760] [2025-03-03 19:53:23,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:23,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-03 19:53:23,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-03 19:53:23,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:23,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2025-03-03 19:53:24,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:24,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884977760] [2025-03-03 19:53:24,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884977760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:53:24,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528804304] [2025-03-03 19:53:24,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:24,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:53:24,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:53:24,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:53:24,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:53:24,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-03 19:53:24,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-03 19:53:24,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:24,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:24,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:53:24,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:53:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2025-03-03 19:53:24,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:53:24,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528804304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:24,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:53:24,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:53:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625931842] [2025-03-03 19:53:24,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:24,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:53:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:24,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:53:24,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:53:24,579 INFO L87 Difference]: Start difference. First operand has 256 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 170 states have internal predecessors, (257), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-03 19:53:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:24,642 INFO L93 Difference]: Finished difference Result 506 states and 929 transitions. [2025-03-03 19:53:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:53:24,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) Word has length 525 [2025-03-03 19:53:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:24,652 INFO L225 Difference]: With dead ends: 506 [2025-03-03 19:53:24,653 INFO L226 Difference]: Without dead ends: 253 [2025-03-03 19:53:24,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:53:24,661 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:24,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:53:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-03 19:53:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-03-03 19:53:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 167 states have (on average 1.4970059880239521) internal successors, (250), 167 states have internal predecessors, (250), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 19:53:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 418 transitions. [2025-03-03 19:53:24,716 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 418 transitions. Word has length 525 [2025-03-03 19:53:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:24,716 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 418 transitions. [2025-03-03 19:53:24,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-03 19:53:24,717 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 418 transitions. [2025-03-03 19:53:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-03-03 19:53:24,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:24,726 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:24,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:53:24,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:53:24,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:24,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1359308637, now seen corresponding path program 1 times [2025-03-03 19:53:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:24,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675858927] [2025-03-03 19:53:24,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:24,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:24,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-03 19:53:25,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-03 19:53:25,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:25,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:25,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:25,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675858927] [2025-03-03 19:53:25,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675858927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:25,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:25,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:53:25,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723991649] [2025-03-03 19:53:25,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:25,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:53:25,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:25,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:53:25,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:53:25,336 INFO L87 Difference]: Start difference. First operand 253 states and 418 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:25,427 INFO L93 Difference]: Finished difference Result 640 states and 1060 transitions. [2025-03-03 19:53:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:53:25,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 525 [2025-03-03 19:53:25,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:25,437 INFO L225 Difference]: With dead ends: 640 [2025-03-03 19:53:25,437 INFO L226 Difference]: Without dead ends: 390 [2025-03-03 19:53:25,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:53:25,439 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 235 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:25,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1003 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:53:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-03 19:53:25,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2025-03-03 19:53:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 284 states have (on average 1.556338028169014) internal successors, (442), 285 states have internal predecessors, (442), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 19:53:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 642 transitions. [2025-03-03 19:53:25,496 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 642 transitions. Word has length 525 [2025-03-03 19:53:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:25,499 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 642 transitions. [2025-03-03 19:53:25,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 642 transitions. [2025-03-03 19:53:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-03 19:53:25,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:25,509 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:25,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:53:25,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:25,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash 170100024, now seen corresponding path program 1 times [2025-03-03 19:53:25,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638060663] [2025-03-03 19:53:25,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:25,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:25,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-03 19:53:25,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-03 19:53:25,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:25,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:25,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:25,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638060663] [2025-03-03 19:53:25,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638060663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:25,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:25,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:53:25,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411435350] [2025-03-03 19:53:25,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:25,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:53:25,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:25,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:53:25,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:53:25,816 INFO L87 Difference]: Start difference. First operand 387 states and 642 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:25,952 INFO L93 Difference]: Finished difference Result 1127 states and 1874 transitions. [2025-03-03 19:53:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:53:25,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 526 [2025-03-03 19:53:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:25,961 INFO L225 Difference]: With dead ends: 1127 [2025-03-03 19:53:25,961 INFO L226 Difference]: Without dead ends: 743 [2025-03-03 19:53:25,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:53:25,963 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 403 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:25,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1142 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:53:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-03-03 19:53:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 429. [2025-03-03 19:53:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 326 states have (on average 1.5337423312883436) internal successors, (500), 327 states have internal predecessors, (500), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 19:53:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 700 transitions. [2025-03-03 19:53:26,020 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 700 transitions. Word has length 526 [2025-03-03 19:53:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:26,024 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 700 transitions. [2025-03-03 19:53:26,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 700 transitions. [2025-03-03 19:53:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-03 19:53:26,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:26,032 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:26,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:53:26,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:26,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:26,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1677651833, now seen corresponding path program 1 times [2025-03-03 19:53:26,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:26,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854859276] [2025-03-03 19:53:26,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:26,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:26,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-03 19:53:26,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-03 19:53:26,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:26,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:26,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854859276] [2025-03-03 19:53:26,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854859276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:26,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:26,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:53:26,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893678770] [2025-03-03 19:53:26,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:26,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:53:26,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:26,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:53:26,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:53:26,714 INFO L87 Difference]: Start difference. First operand 429 states and 700 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:27,169 INFO L93 Difference]: Finished difference Result 1503 states and 2457 transitions. [2025-03-03 19:53:27,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:53:27,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 526 [2025-03-03 19:53:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:27,178 INFO L225 Difference]: With dead ends: 1503 [2025-03-03 19:53:27,179 INFO L226 Difference]: Without dead ends: 1077 [2025-03-03 19:53:27,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:53:27,180 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 498 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:27,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 2024 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:53:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-03 19:53:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 798. [2025-03-03 19:53:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 644 states have (on average 1.5807453416149069) internal successors, (1018), 647 states have internal predecessors, (1018), 149 states have call successors, (149), 4 states have call predecessors, (149), 4 states have return successors, (149), 146 states have call predecessors, (149), 149 states have call successors, (149) [2025-03-03 19:53:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1316 transitions. [2025-03-03 19:53:27,221 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1316 transitions. Word has length 526 [2025-03-03 19:53:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:27,221 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1316 transitions. [2025-03-03 19:53:27,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1316 transitions. [2025-03-03 19:53:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-03 19:53:27,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:27,228 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:27,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:53:27,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:27,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1437111704, now seen corresponding path program 1 times [2025-03-03 19:53:27,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:27,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9782467] [2025-03-03 19:53:27,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:27,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:27,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-03 19:53:27,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-03 19:53:27,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:27,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9782467] [2025-03-03 19:53:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9782467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:27,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:27,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:53:27,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647424063] [2025-03-03 19:53:27,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:27,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:53:27,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:27,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:53:27,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:53:27,706 INFO L87 Difference]: Start difference. First operand 798 states and 1316 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:27,785 INFO L93 Difference]: Finished difference Result 2388 states and 3942 transitions. [2025-03-03 19:53:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:53:27,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 526 [2025-03-03 19:53:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:27,794 INFO L225 Difference]: With dead ends: 2388 [2025-03-03 19:53:27,794 INFO L226 Difference]: Without dead ends: 1593 [2025-03-03 19:53:27,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:53:27,797 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 249 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:27,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 803 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:53:27,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2025-03-03 19:53:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1591. [2025-03-03 19:53:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1284 states have (on average 1.5794392523364487) internal successors, (2028), 1290 states have internal predecessors, (2028), 298 states have call successors, (298), 8 states have call predecessors, (298), 8 states have return successors, (298), 292 states have call predecessors, (298), 298 states have call successors, (298) [2025-03-03 19:53:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2624 transitions. [2025-03-03 19:53:27,890 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2624 transitions. Word has length 526 [2025-03-03 19:53:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:27,891 INFO L471 AbstractCegarLoop]: Abstraction has 1591 states and 2624 transitions. [2025-03-03 19:53:27,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2624 transitions. [2025-03-03 19:53:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-03 19:53:27,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:27,895 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:27,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:53:27,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:27,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:27,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1613091111, now seen corresponding path program 1 times [2025-03-03 19:53:27,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:27,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762935567] [2025-03-03 19:53:27,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:27,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:27,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-03 19:53:27,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-03 19:53:27,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:27,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:28,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:28,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762935567] [2025-03-03 19:53:28,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762935567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:28,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:28,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:53:28,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965839569] [2025-03-03 19:53:28,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:28,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:53:28,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:28,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:53:28,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:53:28,329 INFO L87 Difference]: Start difference. First operand 1591 states and 2624 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:29,022 INFO L93 Difference]: Finished difference Result 5209 states and 8668 transitions. [2025-03-03 19:53:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:53:29,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 526 [2025-03-03 19:53:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:29,041 INFO L225 Difference]: With dead ends: 5209 [2025-03-03 19:53:29,042 INFO L226 Difference]: Without dead ends: 3621 [2025-03-03 19:53:29,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:53:29,047 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 467 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:29,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 2060 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:53:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2025-03-03 19:53:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3268. [2025-03-03 19:53:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3268 states, 2569 states have (on average 1.5605293888672636) internal successors, (4009), 2582 states have internal predecessors, (4009), 680 states have call successors, (680), 18 states have call predecessors, (680), 18 states have return successors, (680), 667 states have call predecessors, (680), 680 states have call successors, (680) [2025-03-03 19:53:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 5369 transitions. [2025-03-03 19:53:29,276 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 5369 transitions. Word has length 526 [2025-03-03 19:53:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:29,277 INFO L471 AbstractCegarLoop]: Abstraction has 3268 states and 5369 transitions. [2025-03-03 19:53:29,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 5369 transitions. [2025-03-03 19:53:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 19:53:29,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:29,281 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:29,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:53:29,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:29,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1388371077, now seen corresponding path program 1 times [2025-03-03 19:53:29,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:29,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955335236] [2025-03-03 19:53:29,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:29,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:53:29,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:53:29,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:29,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:29,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955335236] [2025-03-03 19:53:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955335236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:29,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:29,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:53:29,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21586984] [2025-03-03 19:53:29,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:29,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:53:29,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:29,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:53:29,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:53:29,831 INFO L87 Difference]: Start difference. First operand 3268 states and 5369 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:31,443 INFO L93 Difference]: Finished difference Result 15114 states and 24810 transitions. [2025-03-03 19:53:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:53:31,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 527 [2025-03-03 19:53:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:31,500 INFO L225 Difference]: With dead ends: 15114 [2025-03-03 19:53:31,501 INFO L226 Difference]: Without dead ends: 11988 [2025-03-03 19:53:31,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:53:31,513 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1713 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:31,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 1703 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 19:53:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11988 states. [2025-03-03 19:53:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11988 to 7801. [2025-03-03 19:53:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7801 states, 6164 states have (on average 1.5600259571706685) internal successors, (9616), 6196 states have internal predecessors, (9616), 1592 states have call successors, (1592), 44 states have call predecessors, (1592), 44 states have return successors, (1592), 1560 states have call predecessors, (1592), 1592 states have call successors, (1592) [2025-03-03 19:53:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7801 states to 7801 states and 12800 transitions. [2025-03-03 19:53:32,021 INFO L78 Accepts]: Start accepts. Automaton has 7801 states and 12800 transitions. Word has length 527 [2025-03-03 19:53:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:32,022 INFO L471 AbstractCegarLoop]: Abstraction has 7801 states and 12800 transitions. [2025-03-03 19:53:32,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 7801 states and 12800 transitions. [2025-03-03 19:53:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 19:53:32,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:32,028 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:32,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:53:32,029 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:32,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:32,029 INFO L85 PathProgramCache]: Analyzing trace with hash 244432922, now seen corresponding path program 1 times [2025-03-03 19:53:32,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:32,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283097358] [2025-03-03 19:53:32,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:32,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:32,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:53:32,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:53:32,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:32,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:32,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:32,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283097358] [2025-03-03 19:53:32,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283097358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:32,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:32,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:53:32,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689661767] [2025-03-03 19:53:32,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:32,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:53:32,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:32,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:53:32,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:53:32,206 INFO L87 Difference]: Start difference. First operand 7801 states and 12800 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:32,628 INFO L93 Difference]: Finished difference Result 20888 states and 34186 transitions. [2025-03-03 19:53:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:53:32,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 527 [2025-03-03 19:53:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:32,692 INFO L225 Difference]: With dead ends: 20888 [2025-03-03 19:53:32,692 INFO L226 Difference]: Without dead ends: 13090 [2025-03-03 19:53:32,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:53:32,714 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 254 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:32,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 904 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:53:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13090 states. [2025-03-03 19:53:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13090 to 13079. [2025-03-03 19:53:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13079 states, 10507 states have (on average 1.5432568763681356) internal successors, (16215), 10572 states have internal predecessors, (16215), 2490 states have call successors, (2490), 81 states have call predecessors, (2490), 81 states have return successors, (2490), 2425 states have call predecessors, (2490), 2490 states have call successors, (2490) [2025-03-03 19:53:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13079 states to 13079 states and 21195 transitions. [2025-03-03 19:53:33,324 INFO L78 Accepts]: Start accepts. Automaton has 13079 states and 21195 transitions. Word has length 527 [2025-03-03 19:53:33,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:33,326 INFO L471 AbstractCegarLoop]: Abstraction has 13079 states and 21195 transitions. [2025-03-03 19:53:33,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 13079 states and 21195 transitions. [2025-03-03 19:53:33,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 19:53:33,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:33,335 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:33,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:53:33,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:33,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1264297830, now seen corresponding path program 1 times [2025-03-03 19:53:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:33,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022377514] [2025-03-03 19:53:33,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:33,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:33,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:53:33,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:53:33,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:33,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:33,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:33,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022377514] [2025-03-03 19:53:33,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022377514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:33,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:33,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:53:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284374640] [2025-03-03 19:53:33,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:33,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:53:33,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:33,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:53:33,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:53:33,721 INFO L87 Difference]: Start difference. First operand 13079 states and 21195 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:35,442 INFO L93 Difference]: Finished difference Result 45555 states and 73199 transitions. [2025-03-03 19:53:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:53:35,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 527 [2025-03-03 19:53:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:35,554 INFO L225 Difference]: With dead ends: 45555 [2025-03-03 19:53:35,555 INFO L226 Difference]: Without dead ends: 32549 [2025-03-03 19:53:35,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:53:35,597 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 843 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:35,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1622 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:53:35,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32549 states. [2025-03-03 19:53:36,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32549 to 8416. [2025-03-03 19:53:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8416 states, 6791 states have (on average 1.5601531438668825) internal successors, (10595), 6821 states have internal predecessors, (10595), 1564 states have call successors, (1564), 60 states have call predecessors, (1564), 60 states have return successors, (1564), 1534 states have call predecessors, (1564), 1564 states have call successors, (1564) [2025-03-03 19:53:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 13723 transitions. [2025-03-03 19:53:36,300 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 13723 transitions. Word has length 527 [2025-03-03 19:53:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:36,301 INFO L471 AbstractCegarLoop]: Abstraction has 8416 states and 13723 transitions. [2025-03-03 19:53:36,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 13723 transitions. [2025-03-03 19:53:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 19:53:36,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:36,307 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:36,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:53:36,308 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:36,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1837067716, now seen corresponding path program 1 times [2025-03-03 19:53:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:36,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41964307] [2025-03-03 19:53:36,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:36,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:53:36,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:53:36,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:36,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:36,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:36,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41964307] [2025-03-03 19:53:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41964307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:36,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:36,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:53:36,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132078621] [2025-03-03 19:53:36,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:36,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:53:36,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:36,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:53:36,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:53:36,773 INFO L87 Difference]: Start difference. First operand 8416 states and 13723 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:38,052 INFO L93 Difference]: Finished difference Result 28361 states and 46045 transitions. [2025-03-03 19:53:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:53:38,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 527 [2025-03-03 19:53:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:38,120 INFO L225 Difference]: With dead ends: 28361 [2025-03-03 19:53:38,120 INFO L226 Difference]: Without dead ends: 19948 [2025-03-03 19:53:38,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:53:38,145 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 1009 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:38,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 1591 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:53:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19948 states. [2025-03-03 19:53:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19948 to 6399. [2025-03-03 19:53:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 5162 states have (on average 1.5579232855482372) internal successors, (8042), 5185 states have internal predecessors, (8042), 1190 states have call successors, (1190), 46 states have call predecessors, (1190), 46 states have return successors, (1190), 1167 states have call predecessors, (1190), 1190 states have call successors, (1190) [2025-03-03 19:53:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 10422 transitions. [2025-03-03 19:53:38,972 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 10422 transitions. Word has length 527 [2025-03-03 19:53:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:38,973 INFO L471 AbstractCegarLoop]: Abstraction has 6399 states and 10422 transitions. [2025-03-03 19:53:38,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 10422 transitions. [2025-03-03 19:53:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 19:53:38,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:38,982 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:38,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:53:38,983 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:38,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:38,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1420392634, now seen corresponding path program 1 times [2025-03-03 19:53:38,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:38,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164261759] [2025-03-03 19:53:38,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:39,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:53:39,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:53:39,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:39,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:39,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:39,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164261759] [2025-03-03 19:53:39,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164261759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:39,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:39,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:53:39,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31185591] [2025-03-03 19:53:39,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:39,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:53:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:39,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:53:39,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:53:39,572 INFO L87 Difference]: Start difference. First operand 6399 states and 10422 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:40,669 INFO L93 Difference]: Finished difference Result 16955 states and 27487 transitions. [2025-03-03 19:53:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:53:40,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 527 [2025-03-03 19:53:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:40,705 INFO L225 Difference]: With dead ends: 16955 [2025-03-03 19:53:40,705 INFO L226 Difference]: Without dead ends: 10559 [2025-03-03 19:53:40,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:53:40,720 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 534 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:40,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1795 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:53:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2025-03-03 19:53:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 10171. [2025-03-03 19:53:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10171 states, 8234 states have (on average 1.547971824143794) internal successors, (12746), 8270 states have internal predecessors, (12746), 1864 states have call successors, (1864), 72 states have call predecessors, (1864), 72 states have return successors, (1864), 1828 states have call predecessors, (1864), 1864 states have call successors, (1864) [2025-03-03 19:53:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10171 states to 10171 states and 16474 transitions. [2025-03-03 19:53:41,327 INFO L78 Accepts]: Start accepts. Automaton has 10171 states and 16474 transitions. Word has length 527 [2025-03-03 19:53:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:41,328 INFO L471 AbstractCegarLoop]: Abstraction has 10171 states and 16474 transitions. [2025-03-03 19:53:41,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 10171 states and 16474 transitions. [2025-03-03 19:53:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-03 19:53:41,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:41,334 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:41,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 19:53:41,335 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:41,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:41,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1594384760, now seen corresponding path program 1 times [2025-03-03 19:53:41,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:41,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437606143] [2025-03-03 19:53:41,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:41,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:41,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-03 19:53:41,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-03 19:53:41,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:41,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:41,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:41,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437606143] [2025-03-03 19:53:41,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437606143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:41,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:41,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:53:41,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116415596] [2025-03-03 19:53:41,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:41,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:53:41,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:41,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:53:41,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:53:41,628 INFO L87 Difference]: Start difference. First operand 10171 states and 16474 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:42,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:42,870 INFO L93 Difference]: Finished difference Result 16607 states and 27104 transitions. [2025-03-03 19:53:42,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:53:42,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 528 [2025-03-03 19:53:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:42,911 INFO L225 Difference]: With dead ends: 16607 [2025-03-03 19:53:42,911 INFO L226 Difference]: Without dead ends: 13887 [2025-03-03 19:53:42,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:53:42,920 INFO L435 NwaCegarLoop]: 1090 mSDtfsCounter, 663 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:42,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 3069 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:53:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13887 states. [2025-03-03 19:53:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13887 to 10243. [2025-03-03 19:53:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10243 states, 8306 states have (on average 1.5475559836262942) internal successors, (12854), 8342 states have internal predecessors, (12854), 1864 states have call successors, (1864), 72 states have call predecessors, (1864), 72 states have return successors, (1864), 1828 states have call predecessors, (1864), 1864 states have call successors, (1864) [2025-03-03 19:53:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10243 states to 10243 states and 16582 transitions. [2025-03-03 19:53:43,582 INFO L78 Accepts]: Start accepts. Automaton has 10243 states and 16582 transitions. Word has length 528 [2025-03-03 19:53:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:43,583 INFO L471 AbstractCegarLoop]: Abstraction has 10243 states and 16582 transitions. [2025-03-03 19:53:43,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 10243 states and 16582 transitions. [2025-03-03 19:53:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-03 19:53:43,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:43,623 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:43,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 19:53:43,623 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:43,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash 236441090, now seen corresponding path program 1 times [2025-03-03 19:53:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:43,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713747854] [2025-03-03 19:53:43,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:43,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:43,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-03 19:53:43,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-03 19:53:43,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:43,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:44,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:44,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713747854] [2025-03-03 19:53:44,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713747854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:44,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:44,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:53:44,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965070074] [2025-03-03 19:53:44,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:44,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:53:44,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:44,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:53:44,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:53:44,093 INFO L87 Difference]: Start difference. First operand 10243 states and 16582 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:44,919 INFO L93 Difference]: Finished difference Result 21725 states and 35343 transitions. [2025-03-03 19:53:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:53:44,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 528 [2025-03-03 19:53:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:44,958 INFO L225 Difference]: With dead ends: 21725 [2025-03-03 19:53:44,958 INFO L226 Difference]: Without dead ends: 11485 [2025-03-03 19:53:44,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:53:44,976 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 391 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:44,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1839 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:53:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11485 states. [2025-03-03 19:53:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11485 to 10243. [2025-03-03 19:53:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10243 states, 8306 states have (on average 1.5331085961955213) internal successors, (12734), 8342 states have internal predecessors, (12734), 1864 states have call successors, (1864), 72 states have call predecessors, (1864), 72 states have return successors, (1864), 1828 states have call predecessors, (1864), 1864 states have call successors, (1864) [2025-03-03 19:53:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10243 states to 10243 states and 16462 transitions. [2025-03-03 19:53:45,838 INFO L78 Accepts]: Start accepts. Automaton has 10243 states and 16462 transitions. Word has length 528 [2025-03-03 19:53:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:45,839 INFO L471 AbstractCegarLoop]: Abstraction has 10243 states and 16462 transitions. [2025-03-03 19:53:45,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 10243 states and 16462 transitions. [2025-03-03 19:53:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-03 19:53:45,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:45,844 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:45,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 19:53:45,845 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:45,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash 841167572, now seen corresponding path program 1 times [2025-03-03 19:53:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:45,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417335087] [2025-03-03 19:53:45,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:45,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 19:53:45,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 19:53:45,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:45,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:46,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:46,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417335087] [2025-03-03 19:53:46,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417335087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:46,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:46,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:53:46,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679273925] [2025-03-03 19:53:46,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:46,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:53:46,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:46,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:53:46,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:53:46,099 INFO L87 Difference]: Start difference. First operand 10243 states and 16462 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:46,665 INFO L93 Difference]: Finished difference Result 20507 states and 32969 transitions. [2025-03-03 19:53:46,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:53:46,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 532 [2025-03-03 19:53:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:46,691 INFO L225 Difference]: With dead ends: 20507 [2025-03-03 19:53:46,691 INFO L226 Difference]: Without dead ends: 10267 [2025-03-03 19:53:46,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:53:46,708 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 0 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:46,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 801 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:53:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10267 states. [2025-03-03 19:53:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10267 to 10267. [2025-03-03 19:53:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10267 states, 8330 states have (on average 1.5277310924369747) internal successors, (12726), 8366 states have internal predecessors, (12726), 1864 states have call successors, (1864), 72 states have call predecessors, (1864), 72 states have return successors, (1864), 1828 states have call predecessors, (1864), 1864 states have call successors, (1864) [2025-03-03 19:53:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10267 states to 10267 states and 16454 transitions. [2025-03-03 19:53:47,429 INFO L78 Accepts]: Start accepts. Automaton has 10267 states and 16454 transitions. Word has length 532 [2025-03-03 19:53:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:47,430 INFO L471 AbstractCegarLoop]: Abstraction has 10267 states and 16454 transitions. [2025-03-03 19:53:47,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 10267 states and 16454 transitions. [2025-03-03 19:53:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-03 19:53:47,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:47,436 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:47,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 19:53:47,436 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:47,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:47,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2100490027, now seen corresponding path program 1 times [2025-03-03 19:53:47,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:47,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899067335] [2025-03-03 19:53:47,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:47,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:47,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 19:53:47,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 19:53:47,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:47,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:47,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:47,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899067335] [2025-03-03 19:53:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899067335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:47,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:53:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908466870] [2025-03-03 19:53:47,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:47,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:53:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:47,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:53:47,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:53:47,717 INFO L87 Difference]: Start difference. First operand 10267 states and 16454 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:49,951 INFO L93 Difference]: Finished difference Result 31367 states and 49837 transitions. [2025-03-03 19:53:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:53:49,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 532 [2025-03-03 19:53:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:50,009 INFO L225 Difference]: With dead ends: 31367 [2025-03-03 19:53:50,009 INFO L226 Difference]: Without dead ends: 21103 [2025-03-03 19:53:50,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:53:50,036 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 948 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:50,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1794 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 19:53:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21103 states. [2025-03-03 19:53:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21103 to 16043. [2025-03-03 19:53:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16043 states, 13034 states have (on average 1.5066748503912843) internal successors, (19638), 13090 states have internal predecessors, (19638), 2896 states have call successors, (2896), 112 states have call predecessors, (2896), 112 states have return successors, (2896), 2840 states have call predecessors, (2896), 2896 states have call successors, (2896) [2025-03-03 19:53:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16043 states to 16043 states and 25430 transitions. [2025-03-03 19:53:51,728 INFO L78 Accepts]: Start accepts. Automaton has 16043 states and 25430 transitions. Word has length 532 [2025-03-03 19:53:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:53:51,728 INFO L471 AbstractCegarLoop]: Abstraction has 16043 states and 25430 transitions. [2025-03-03 19:53:51,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 16043 states and 25430 transitions. [2025-03-03 19:53:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-03 19:53:51,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:53:51,733 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:53:51,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 19:53:51,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:53:51,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:53:51,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1757377405, now seen corresponding path program 1 times [2025-03-03 19:53:51,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:53:51,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456299981] [2025-03-03 19:53:51,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:53:51,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:53:51,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 19:53:51,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 19:53:51,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:53:51,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:53:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-03 19:53:56,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:53:56,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456299981] [2025-03-03 19:53:56,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456299981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:53:56,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:53:56,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 19:53:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185190211] [2025-03-03 19:53:56,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:53:56,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:53:56,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:53:56,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:53:56,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:53:56,289 INFO L87 Difference]: Start difference. First operand 16043 states and 25430 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:53:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:59,336 INFO L93 Difference]: Finished difference Result 28643 states and 43807 transitions. [2025-03-03 19:53:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 19:53:59,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 532 [2025-03-03 19:53:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:59,377 INFO L225 Difference]: With dead ends: 28643 [2025-03-03 19:53:59,377 INFO L226 Difference]: Without dead ends: 22151 [2025-03-03 19:53:59,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:53:59,390 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 223 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:59,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1590 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:53:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22151 states. [2025-03-03 19:54:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22151 to 21159. [2025-03-03 19:54:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21159 states, 17946 states have (on average 1.450239607712025) internal successors, (26026), 18070 states have internal predecessors, (26026), 3032 states have call successors, (3032), 180 states have call predecessors, (3032), 180 states have return successors, (3032), 2908 states have call predecessors, (3032), 3032 states have call successors, (3032) [2025-03-03 19:54:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21159 states to 21159 states and 32090 transitions. [2025-03-03 19:54:01,201 INFO L78 Accepts]: Start accepts. Automaton has 21159 states and 32090 transitions. Word has length 532 [2025-03-03 19:54:01,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:54:01,202 INFO L471 AbstractCegarLoop]: Abstraction has 21159 states and 32090 transitions. [2025-03-03 19:54:01,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-03 19:54:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 21159 states and 32090 transitions. [2025-03-03 19:54:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-03 19:54:01,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:54:01,208 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:54:01,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 19:54:01,208 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:54:01,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:54:01,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1292825410, now seen corresponding path program 1 times [2025-03-03 19:54:01,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:54:01,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167541019] [2025-03-03 19:54:01,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:54:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:54:01,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 19:54:01,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 19:54:01,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:54:01,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:54:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 78 proven. 171 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-03 19:54:01,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:54:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167541019] [2025-03-03 19:54:01,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167541019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:54:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472119355] [2025-03-03 19:54:01,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:54:01,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:54:01,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:54:01,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:54:01,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:54:01,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 19:54:01,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 19:54:01,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:54:01,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:54:01,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 19:54:01,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:54:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 6593 proven. 156 refuted. 0 times theorem prover too weak. 7195 trivial. 0 not checked. [2025-03-03 19:54:02,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:54:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 93 proven. 156 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-03 19:54:02,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472119355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:54:02,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:54:02,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2025-03-03 19:54:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122357091] [2025-03-03 19:54:02,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:54:02,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 19:54:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:54:02,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 19:54:02,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:54:02,890 INFO L87 Difference]: Start difference. First operand 21159 states and 32090 transitions. Second operand has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 14 states have internal predecessors, (221), 4 states have call successors, (193), 2 states have call predecessors, (193), 4 states have return successors, (195), 4 states have call predecessors, (195), 4 states have call successors, (195) [2025-03-03 19:54:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:54:10,143 INFO L93 Difference]: Finished difference Result 88811 states and 132466 transitions. [2025-03-03 19:54:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 19:54:10,143 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 14 states have internal predecessors, (221), 4 states have call successors, (193), 2 states have call predecessors, (193), 4 states have return successors, (195), 4 states have call predecessors, (195), 4 states have call successors, (195) Word has length 532 [2025-03-03 19:54:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:54:10,272 INFO L225 Difference]: With dead ends: 88811 [2025-03-03 19:54:10,272 INFO L226 Difference]: Without dead ends: 67655 [2025-03-03 19:54:10,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1099 GetRequests, 1063 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=996, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 19:54:10,310 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 2849 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 944 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:54:10,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 2086 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [944 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 19:54:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67655 states. [2025-03-03 19:54:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67655 to 66531. [2025-03-03 19:54:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66531 states, 58706 states have (on average 1.43750212925425) internal successors, (84390), 59190 states have internal predecessors, (84390), 7188 states have call successors, (7188), 636 states have call predecessors, (7188), 636 states have return successors, (7188), 6704 states have call predecessors, (7188), 7188 states have call successors, (7188) [2025-03-03 19:54:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66531 states to 66531 states and 98766 transitions. [2025-03-03 19:54:16,512 INFO L78 Accepts]: Start accepts. Automaton has 66531 states and 98766 transitions. Word has length 532 [2025-03-03 19:54:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:54:16,513 INFO L471 AbstractCegarLoop]: Abstraction has 66531 states and 98766 transitions. [2025-03-03 19:54:16,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 14 states have internal predecessors, (221), 4 states have call successors, (193), 2 states have call predecessors, (193), 4 states have return successors, (195), 4 states have call predecessors, (195), 4 states have call successors, (195) [2025-03-03 19:54:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 66531 states and 98766 transitions. [2025-03-03 19:54:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-03 19:54:16,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:54:16,537 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:54:16,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:54:16,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 19:54:16,738 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:54:16,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:54:16,738 INFO L85 PathProgramCache]: Analyzing trace with hash -563784516, now seen corresponding path program 1 times [2025-03-03 19:54:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:54:16,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219146011] [2025-03-03 19:54:16,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:54:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:54:16,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 19:54:16,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 19:54:16,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:54:16,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:54:16,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1756650651] [2025-03-03 19:54:16,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:54:16,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:54:16,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:54:16,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:54:16,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:54:17,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 19:54:17,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 19:54:17,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:54:17,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:54:17,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 19:54:17,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:54:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 6063 proven. 171 refuted. 0 times theorem prover too weak. 7710 trivial. 0 not checked. [2025-03-03 19:54:18,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:54:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 78 proven. 171 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-03 19:54:18,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:54:18,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219146011] [2025-03-03 19:54:18,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:54:18,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756650651] [2025-03-03 19:54:18,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756650651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:54:18,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:54:18,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2025-03-03 19:54:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755077555] [2025-03-03 19:54:18,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:54:18,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 19:54:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:54:18,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 19:54:18,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:54:18,865 INFO L87 Difference]: Start difference. First operand 66531 states and 98766 transitions. Second operand has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 18 states have internal predecessors, (155), 2 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (142), 2 states have call predecessors, (142), 2 states have call successors, (142)